Glossary: Algorithms Beyond the Basics in Rust

Big-O

Also written: O(n), time complexity

A way to describe how the running time or memory of an algorithm grows as the input grows, such as O(n) or O(n log n). It ignores constant factors and focuses on the growth rate.