The Intuitive Guide to Data Structures and Algorithms

by Parker Phinney

With big O notation we express the runtime in terms of—brace yourself—how quickly it grows relative to the input, as the input gets arbitrarily large.