How Big O works (explained in 2 mins or less): ✓ Big O tells how much slower a code gets as the input increases. ✓ There are best, average, and worst cases for a specific algorithm. ✓ Besides there are Big Os for time, memory, and storage efficiency. ✓ Big O helps to understand which data structures or algorithms have better performance. ✓ Big O shows the growth rate and not the actual speed. So it's important to test the input data. What else would you add? —— 👋 PS - Want my System Design...
