渐进性分析（asymptomatic analysis)& 大O的数学定义&时间复杂度

最新推荐文章于 2024-07-17 12:09:23 发布

wengyupeng

最新推荐文章于 2024-07-17 12:09:23 发布

阅读量6.3k

点赞数 5

分类专栏： Algorithm 文章标签：渐进性分析（asymptomatic analysis) 大O的数学定义时间复杂度

本文链接：https://blog.csdn.net/wengyupeng/article/details/85038895

版权

Algorithm 专栏收录该内容

16 篇文章 0 订阅

订阅专栏

一、什么是渐进性分析？

假设同一个任务，有2种算法，如何去找出那个更好？

一个简单的办法——用两个程序实现这两种算法，然后输入不同的数据，在你电脑上运行这两个程序，看看那个需要的时间更少。用这种方法分析算法，有很多问题。

1. 对一些输入，可能第一个性能更好；对另外一些，可能第二更好

2. 对一些输入，第一个算法在一台机器上表现更好，另外一个算法在其它的机器上更好。

渐进性分析是为解决上面算法分析中的问题。根据输入规模来评估一个算法的性能，而不是测量实际运行时间。

通过输入规模的增加来计算算法需要的时间和空间的增长趋势。

参考： Analysis of Algorithms

Given two algorithms for a task, how do we find out which one is better?
One naive way of doing this is – implement both the algorithms and run the two programs on your computer for different inputs and see which one takes less time. There are many problems with this approach for analysis of algorithms.
1) It might be possible that for some inputs, first algorithm performs better than the second. And for some inputs second performs better.
2) It might also be possible that for some inputs, first algorithm perform better on one machine and the second works better on other machine for some other inputs

Asymptotic Analysis is the big idea that handles above issues in analyzing algorithms. In Asymptotic Analysis, we evaluate the performance of an algorithm in terms of input size (we don’t measure the actual running time). We calculate, how does the time (or space) taken by an algorithm increases with the input size.