Why the Library Check Slows Down and Play Doesn't: O(1) and O(n)
Tell a job whose work stays the same as the library grows from one whose work grows with it, and read their growth rates aloud: O(1), constant time, and O(n), linear time.
Updated

- Category
- Data Structures
- Level
- Novice
- Tags
- Big-O Notation, Constant Time, Linear Time, software-development