You’ve finished your free lessons! 🎉
Create a free account to unlock every lesson, save your progress, keep your streak and get personal review suggestions. It takes 20 seconds.
LESSON 11 / 17
O(log n) — Logarithmic Time
O(log n) algorithms halve the problem at every step. Double the input and you need just ONE more step. Binary search is the star example.
🎓Hardlevel
⏱️12 minto finish
✏️1activities
