What is the minimum number of comparisons required to find the largest and smallest elements of an unsorted list of n distinct elements?
What could be the best time complexity for above algorithm?
From minimum number of comparisons I meant to specify the most efficient algorithm, for the worst case.