LESSON 12 / 17

O(n) — Linear Time

O(n) algorithms look at each item a fixed number of times. Double the input, double the work. Most single-pass algorithms are linear.

🎓Hardlevel
⏱️11 minto finish
✏️1activities

📂 Correctness, Complexity & Quality🏷️ Complexity