Glossary: Data Structures and Algorithms in C++

Worst case

The most work an algorithm can need for an input of size n, the slowest input and the one that hurts users. Big-O is usually quoted for it.