Asymptotic Analysis是一种简化的分析算法时间复杂度的方法,它主要应用big Oh notation。
the rules for computing and manipulating big oh expressions greatly simplify the analysis of the running time of a program when all we are interested in is its asymptotic behavior.
一、几种基本的Big Oh表达式
O(1) -- constant
O(log10(n)) -- logarithmic
O((log10(n))^2) -- log squared
O(n) -- linear
O(n * log10(n)) -- n log n
O(n^2) -- quadratic
O(n^3) -- cubic
O(2^n) -- exponential
一般地,使用这几种表达式去套一种算法&#