Best case

The cheapest an algorithm can be on the easiest input. A search that finds the item on the first try has a best case of one step. Best case alone says little, so it is always reported with the others.

• See also: Computational complexity
• See also: Worst case
• Used in: Measuring Work

Back to the glossary