- Big-Theta
- Big-O
- Big-Omega
Algoritm Analysis
-
Space Complexity
-
Time Complexity
Asymptotic notation
we use asymptotic notation to express the rate of growth of an algorithm's running time in terms of the input size n.
Big-Theta
asymptotically tight bound
Big-O
asymptotic upper bounds
Big-Omega
asymptotic lower bounds
Reference：