0
What is the minimum number of comparisons (in terms of n) required to find both the minimum and maximum of an unsorted array of n elements, using the optimal pairwise-comparison algorithm?
- An-1
- B2n-2
- C⌈3n/2⌉ - 2
- Dn log n
Correct answer: C
Discussion 0
Log in or create a free account to reply and vote.
Nobody has replied yet. Start the discussion!