Common Examples of Asymptotic Running Times

最新推荐文章于 2025-06-10 15:14:42 发布

weixin_34150503

最新推荐文章于 2025-06-10 15:14:42 发布

阅读量114

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/grep/archive/2012/08/18/2645091.html

本文详细介绍了算法复杂度的种类，包括常数复杂度、对数复杂度、线性复杂度、对数线性复杂度、多项式复杂度、二次复杂度等，并通过实例解释了每种复杂度的特点。

Complexity	Name	Examples, Comments
Θ(1)	Constant	Hash table lookup and modification
Θ(lgn)	logarithmic	Binary Search
Θ(n)	Linear	iterating over a list
Θ(nlgn)	LogLinear	Optimal sorting of arbitrary values
Θ(n²)	Quadratic	Comparing n objects to each other( all against all)
Θ(n³)	Cubic	Floyd and Warshall's algorithms
Θ(n^k)	Polynomial	k nested for loops over n
Θ(kⁿ)	Exponential	Producing every subset of n items
Θ(n!)	Factorial	Producing every ordering of n values