Big O Notation
Big O Notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity. It is used to describe the performance or complexity of an algorithm.
Time Limit Exceed(TLE)¶
Roughly MAX value of n |
Time Complexity |
|---|---|
| 10^9 | O(log n) or O(sqrt(n)) |
| 10^8 | O(n) (Border case) |
| 10^7 | O(n) (Might be accepted) |
| 10^6 | O(n) (Perfect) |
| 10^5 | O(n * log n) |
| 10^4 | O(n2) |
| 10^2 | O(n3) |
| <= 160 | O(n4) |
| <= 18 | O(2n * n2) |
| <= 10 | O(n!), O(2n) |
Cheat Sheet¶
