Skip to content

Glossary: Data Structures and Algorithms in Python

Worst case

The most work an algorithm can need for an input of size n, such as searching for the last or a missing order ID. It's the case planned for because it hurts users most.

Where the book teaches it

Related terms

Average caseBig-O notation