Given an unordered list of \(n\geq 3\) distinct elements, what is the minimum number of comparisons required to find an element that is neither maximum nor minimum?

×

Problem Loading...

Note Loading...

Set Loading...