[see also: have to, necessarily, force]
Any algorithm to find max must do at least n comparisons.
We must have Lf=0, for otherwise we can replace f by f-Lf.
Our present assumption implies that the last inequality in (8) must actually be an equality.
Go to List of words starting with:
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
Y
Z