Foundations

Two ideas run through every other page on this site.

Page	What it explains
Big-O and running time	How to say how fast an algorithm is without a stopwatch: count steps, keep the part that grows fastest
Recursion	A function that calls itself on a smaller problem; how to trust it, how to time it, and the master theorem

After these, sorting is the natural next topic: it uses both ideas over and over.