Results

Results

• The largest key must be compared with lg n other keys
• Finding the second largest requires at least lg n comparisons after finding the largest
• This is a lower bound
• The tournament algorithm is optimal

Previous slide

Back to the first slide

View Graphic Version