1.25 Write an algorithm to find both the smallest and largest elements in a set of n entries. Try to find a method that does roughly 1.5n comparisons of elements in the worst case. Show transcribed image text
Expert Answer
An answer will be send to you shortly. . . . .