Big-O notation: describing how an algorithm grows

Two programs can both give the right answer, yet one finishes instantly and the other takes hours once the data gets big. Timing them on your laptop does not tell the whole story, because results depend on the machine and the input. Big-O notation gives programmers a shared way to describe how the work an algorithm does grows as the input size grows.