Big Oh Notation (O) | Data Structures Tutorial pdf

Big Oh Notation (O):- O is called asymptotically upper bound. If f(n) and g(n) are two non negative functions then,

F (n) =O (g (n))
If positive constants c and n0 such that
0 <= f (n) <=c g (n) for all n>=n0
The performance of an algorithm is measured by considering following:
=> Time Complexity
=> Space Complexity