Worst case

The most work an algorithm can take on the hardest input of a given size. This is the number to plan with, since a real user can hit the hard input. A guarantee on the worst case is stronger than an average.

• See also: Computational complexity
• See also: Best case
• See also: Average case
• Used in: Measuring Work

Back to the glossary