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
n
B
About 3n/2 by comparing elements in pairs
C
n log n
D
2n − 2