Practice
Learn
← Quit
0 / 0 correct
Algorithms
Hard
1 of 10
How many comparisons does it take to find both the min and max of n elements optimally?
A
About 3n/2 by comparing elements in pairs
B
2n − 2
C
n
D
n log n