Contrast with sequential search.
In particular, there is no early exit from finding the largest algorithm.
How is this algorithm an example of divide and conquer?
largest in A1,
A2, ..., Ai,
by finding the largest in A1,
Ai and comparing that to Ai+1.
Last Updated 01/05/2000
© L.Heath, 2000