Big O Notation - kimschles/schlesinger-knowledge GitHub Wiki

Big O notation describes 2 things:

1. The amount of memory an algorithm needs to run
2. The time the algorithm will take a runtime based on how much data is passed to the algorithm

• 'O' stands for order
• O(1) is constant time
• O(n) is linear time
• O(n²) is