Glossary: Data Structures and Algorithms in Go

Worst case

The most work an algorithm can need for an input of size n, such as a missing target in linear search. It is what we usually plan for because it is what hurts users.