Lower bound(floor)

A proven minimum cost that no algorithm can beat for a problem. Finding the largest item needs a look at every item, so n is its floor. When your cost matches the floor, the algorithm is optimal and tuning further is wasted effort.