1 note tagged
algorithms
- Big O
Big O is how we measure how fast an algorithm is, and how fast it grows as the input N grows O(n) means the algorithm increases at the same rate as their input o(log n) means it…
Big O is how we measure how fast an algorithm is, and how fast it grows as the input N grows O(n) means the algorithm increases at the same rate as their input o(log n) means it…