# Big-O in Plain Words

One question, "if I have twice as much stuff, how much more work is it?", and the six answers to it that cover almost everything.

Updated: November 17, 2026

## [Counting Steps](https://www.ask-codey.com/courses/data-structures/topics/ds-counting-steps)

1. [Twice the Stuff, How Much More Work?](https://www.ask-codey.com/lessons/big-o-twice-the-stuff) (Novice): Big-O answers one question about any piece of code: if there's twice as much stuff, how much more work is it? Most of the time the answer is the same, twice, or four times.
2. [How Slow Will It Get? Counting Steps](https://www.ask-codey.com/lessons/big-o-counting-steps) (Novice): Count the steps a loop takes instead of timing it in seconds, call the amount of data n, and watch a loop's steps grow right along with n.

## [The Growth-Rate Family](https://www.ask-codey.com/courses/data-structures/topics/ds-the-growth-rate-family)

1. [Why the Library Check Slows Down and Play Doesn't: O(1) and O(n)](https://www.ask-codey.com/lessons/big-o-constant-and-linear) (Novice): 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.
2. [How Many Times Can You Halve a Million? O(log n)](https://www.ask-codey.com/lessons/big-o-logarithmic) (Novice): Find one song among a million sorted titles in about 20 looks instead of a million, and name the growth rate that makes it possible: O(log n), logarithmic time.
3. [Why the Duplicates Button Crawls: O(n²)](https://www.ask-codey.com/lessons/big-o-quadratic) (Novice): Find out why a "find duplicates" button that takes a second at 10,000 songs takes about half a minute at 50,000, spot the loop-inside-a-loop that causes it, and name its growth rate: O(n²), quadratic time.
4. [Sorting a Million Songs, and the Playlist You Can't Compute: O(n log n) and O(2ⁿ)](https://www.ask-codey.com/lessons/big-o-n-log-n-and-exponential) (Apprentice): See why a good sort handles a million songs in under a second while the obvious ways take most of a day, and why a playlist that fills exactly 60 minutes can't be found by trying every combination: O(n log n) and O(2ⁿ).
5. [Will It Survive a Million Users? The Doubling Table](https://www.ask-codey.com/lessons/big-o-doubling-table) (Novice): One table puts all six growth rates side by side at 10, 1,000 and 1,000,000 items, and shows why the growth rate of your code matters far more than the speed of your computer.

## [Reading Big-O](https://www.ask-codey.com/courses/data-structures/topics/ds-reading-big-o)

1. [Are Two Loops Twice as Slow? Why O(2n) Is Still O(n)](https://www.ask-codey.com/lessons/big-o-dropping-constants) (Apprentice): Big-O keeps only the part of the step count that grows fastest and drops the rest, so 2n steps is O(n) and n² + n steps is O(n²). Here's why, and when the small stuff still matters.
2. [Fast in the Demo, Slow for Users: Best, Worst and Average](https://www.ask-codey.com/lessons/big-o-best-worst-average) (Apprentice): Explain why a search that was instant in your demo is slow for users, name its best, worst and average cases, and see why Big-O usually promises the worst one.

## [Exercise: Find the Duplicate Songs](https://www.ask-codey.com/courses/data-structures/topics/exercise-big-o-duplicate-songs)

1. [Exercise: Find the Duplicate Songs](https://www.ask-codey.com/lessons/exercise-big-o-duplicate-songs) (Apprentice): Users with big libraries say the "find duplicate songs" button never finishes: write a new one with the same answers that handles 200,000 songs in under 2 seconds, count what today's button costs, and name each one's growth rate.

Source: https://www.ask-codey.com/courses/data-structures/chapters/big-o-plain-words
