Glossary: Data Structures and Algorithms in Rust

Worst case

Also written: worst-case

The most work an algorithm can need for an input of size n, such as searching for a missing target in linear search. It is used for planning because it describes the slowest outcome users could face.