Complexity analysis estimates how running time and memory grow with input size, using asymptotic notation (O, Ω, Θ).
1Common orders
O(1) < O(log n) < O(n) < O(n log n) < O(n²) < O(n³) < O(2ⁿ) < O(n!)
Loading subject content…
Loading subject content…
Complexity analysis estimates how running time and memory grow with input size, using asymptotic notation (O, Ω, Θ).
O(1) < O(log n) < O(n) < O(n log n) < O(n²) < O(n³) < O(2ⁿ) < O(n!)