TechnologyThe BestieIntermediate
Big-O in Real Code, a free technology course on Tomo

Big-O in Real Code

Move beyond counting simple loops to evaluate hidden runtime costs, memory overhead, and algorithmic tradeoffs in production software.

Like Duolingo, but for Big-O in Real Code. Tomo turns the whole topic into a game you play five minutes a day, until it actually sticks.

A short one: 10 levels across 2 sections, about 20 minutes end to end, roughly 4 days at five minutes a day. It moves through Auditing Complexity Beyond Obvious Loops and Complexity Under Real-World Constraints. It assumes you already know the basics.

10 bite-size levelsAbout 5 minutes each

Free forever · No credit card · iPhone & Android

Ollie the Owl, the guide who teaches the Big-O in Real Code course
Big-O in Real Code
with Ollie the Owl
10
Levels
2
Sections
5
Min/day
What you'll learn

Key ideas in Big-O in Real Code

  • Standard library conveniences mask full linear iterations behind concise syntax.
  • Unsorted array membership scans elements sequentially, costing O(N) hidden time.
  • N loop passes executing an inner O(N) library call combine into O(N²) overall time.
  • Sequential passes over independent inputs sum their sizes into O(A + B).
  • Nested passes across independent collections multiply their inputs into O(A · B).
  • Combining distinct inputs into a single N obscures which input drives bottlenecks.
  • Big-O notation conventionally benchmarks execution against worst-case scenarios.
  • Early breaks improve average or best-case speed but do not lower worst-case bounds.
  • When the target item is last or absent, the loop still executes O(N) iterations.
  • Total costs require identifying unlisted hidden library iterations first.
  • Combining hidden inner steps yields an unsimplified multi-term runtime expression.
  • Dropping non-dominant terms and coefficients happens only on the final expression.
  • Recursive time complexity scales with the total invocation count across the call tree.
  • Auxiliary space complexity reflects only the deepest simultaneous chain of stack frames.
  • Resolved recursive branches pop off the stack, freeing memory before adjacent branches execute.
  • A constant branching factor of two doubles total calls at every downward level of the tree.
Why not just Google it

You've tried the other tabs

Wikipedia

Thirty open tabs. Four facts you actually kept.

YouTube

You watched. You nodded. By Sunday it was gone.

ChatGPT

One answer, then back to scrolling.

Online courses

Eight weeks. You meant to finish. You didn't.

Tomo gives Big-O in Real Code the Duolingo treatment: levels, streaks, and quick quizzes that test what you just learned. That game loop is what the tabs above never had, so it's the one you actually finish.

Try a question

Here's what playing it feels like

A real question from this course. Take your best guess.

Unmasking Hidden Loops in Code

You check if a value exists in an unsorted array of size N. What is the hidden cost of this membership check?

Get it right to open this lesson and 9 more in the app.

Course map

Where Big-O in Real Code takes you

  1. 1

    Auditing Complexity Beyond Obvious Loops

    • Spotting Hidden Costs in Standard Library Calls
    • Mapping Call Stacks and Tree Depth
  2. 2

    Complexity Under Real-World Constraints

    • Evaluating Amortized Costs and Memory Tradeoffs
    • Navigating Asymptotics Versus Hardware Reality

2 sections · 4 units · 10 levels. Built to play, not to enroll.

New

Tomo is in ChatGPT

Tomo is also a ChatGPT plugin: the same playable courses, built and played inside your chat.

Add Tomo to ChatGPT
How it's taught

You pick the voice

This course
The Bestie

Big-O in Real Code is taught in the The Bestie style: your friend who just gets it. Want a different feel? In the app you can spin up the same topic in any of Tomo's teaching styles. Same facts, totally different vibe.

Start free

Start Big-O in Real Code today.

Download Tomo, search Big-O in Real Code, and play your first lesson in under a minute.