Computer Science / Unit 3 CS 0128 short lesson, about 20 seconds
Big O Notation
Captions available
The idea
Big O notation names an order of growth: a cost sits in O of g when their ratio stays bounded as inputs grow — O(1) constant, O(N) linear, O(log N) logarithmic.
In practice
A feed that loads in the same time at any account size earns its O(1).
Where people slip
The notation names what counting already showed.
Your place on the trail
Every lesson rests on earlier ones and opens later ones. Tap any to jump.
Something wrong in this lesson? Flag it · Sources for Computer Science