当前位置：网站首页>time complexity and space complexity

time complexity and space complexity

2022-08-05 06:14:00 【CrazyQiQi】

Time and space complexity

1. Time complexity of the algorithm

Concept: When performing algorithm analysis, the total number of executions of the statement T(n) is a function of the problem size n, and then analyze the change of T(n) with n and determine the order of magnitude of T(n).
Formula: T(n)=O(f(n)), f(n) is some function of problem size n
Common time complexity

Example	Time Complexity	Terms
5201314	O(1)	Constant order
3n+4	O(n)	Linear order
3n^2+4	O(n^2)	Square order
3log(2)n+4	O(logn)	Logarithmic
2n+3nlog(2)n+4	O(nlogn)	nlogn order
n³⁺²ⁿ2+4n+3	O(n^3)	Cubic order
2^n	O(2^n)	Exponential order

Time spent in common time complexity

2. Space complexity of the algorithm

Concept: The space complexity of the algorithm is realized by calculating the storage space required by the algorithm
Calculation formula: S(n) = O(f(n)), where n is the problem size and f(n) isStatement about the function of the storage space occupied by n

原网站

版权声明
本文为[CrazyQiQi]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/217/202208050514556078.html