Data structure and algorithm study notes
- Big O
n = 1,000
- O(n^2) - A loop within a loop. 1,000,000
- O(n) - Proportional. 1,000
- O9log n) - Divide and Conquer. ~10
- O(1) - Constant Time. 1
Big O Cheat Sheet: https://www.bigocheatsheet.com/
Data structure and algorithm study notes
n = 1,000
Big O Cheat Sheet: https://www.bigocheatsheet.com/