Best Case and Worst Case

One algorithm carries several counts: the best case when the input cooperates, the worst case when it resists — each case analyzed on its own.

Hunting a word front-to-back through a dictionary costs one look when the word sits first, and every look when it sits last or nowhere.