Skip to content

Glossary: Algorithms Beyond the Basics

Big-O

Also written: Big O

A rough way to describe how a program's running time or memory grows with the input size n, such as O(n) or O(n²). It is used to compare how well different solutions scale.

Where the book teaches it

Related terms

Brute force