Skip to content

Glossary: Algorithms Beyond the Basics in C++

Big-O

Also written: Big O

A way to describe how an algorithm's running time or memory grows as the input size n grows, such as O(n) or O(n²). It ignores constant factors and focuses on the growth trend.

Where the book teaches it

Related terms

brute force