Big O Notation






4.43/5 (7 votes)
Big O Notation is a way of expressing the worst case complexity or order of growth of an algorithm. It is not as scary and something to only break out during interviews.
4.43/5 (7 votes)
Big O Notation is a way of expressing the worst case complexity or order of growth of an algorithm. It is not as scary and something to only break out during interviews.