- As your input grows, how fast does computation or memory grow?
- One loop is O(N).
- Practically, O(N^2) could be faster than O(N) given small data sets.
- 0(1) > O(logN) > O(N) > 0(N * logN) > O(N^2) > O(2^N) > O(N^!)
Look inside the algorithms or data-structures folders for additional notes