Big-O notation

Home > Computer Science > Theory of Computation > Algorithm Design and Analysis > Big-O notation

A way to express the rate at which the resources required by an algorithm grow as the input size increases.