Skip to content
Computer Sciencestretch

Big-O Basics

Comparing algorithms by how their work grows with input size, not by stopwatch.

By the end you should be able to

  • Read a simple Big-O claim and say what it means in practice
  • Order common growth rates by cost

Prerequisites

You can start here anyway — the tutor will remind you where these matter, and the adaptive step will send you back if your attempts suggest a gap.

Big-O Basics · AURA