Computer Science / Unit 3 CS 0143 short lesson, about 20 seconds
Sequential Search, Measured
Captions available
The idea
Sequential search checks a collection element by element for the target, and its runtime sits in O(N) — cost growing linearly with the number of elements.
In practice
A roll call read top to bottom takes as long as the roster is long.
Where people slip
The method's virtue is needing no structure at all.
Your place on the trail
Every lesson rests on earlier ones and opens later ones. Tap any to jump.
Builds on
Unlocks
- Nothing yet depends on this.
Something wrong in this lesson? Flag it · Sources for Computer Science