Back to the course

Data Structures & Algorithms · Course map

Course map›Required

Complexity & Big-O

How to measure an algorithm by how its work grows with the input, not by seconds on your laptop. Big-O notation, the common growth classes (constant, logarithmic, linear, n log n, quadratic, exponential) and how to read them off a loop.

Required
Sign in to track progress