Skip to content

Glossary: Algorithms Beyond the Basics in Go

Big-O

Also written: O(n), big O

A way to describe how a program's time or memory grows with input size n. O(n) grows in step with n, while O(n²) grows with its square.

Where the book teaches it

Related terms

AmortizedBrute force