Skip to content

Glossary: Data Structures and Algorithms in Java

worst case

The most work an algorithm can need for an input of a given size, such as linear search when the target is last or missing. It is what we usually plan for.

Where the book teaches it

Related terms

average caseBig-O notation