Skip to content

Glossary: Data Structures and Algorithms in JavaScript

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 is the case you plan for.

Where the book teaches it

Related terms

Average caseBig-O notation