Question

At the county fair, prizes are awat rded to the five heaviest cows. More than 2000 cows are entered, and their records are stored in an array. Which of the following algorithms provides the most effecient way of finding the records of the five heaviest cows?

a. Selection Sort
b. Selection Sort terminated after the first five iterations
c. Insertion Sort
d. Insertion Sort terminated after the first five iterations
e. Mergesort

Answer 1

B

Step-by-step explanation:

selection sort for each pass sorts one element in right place . so we can stop it after 5 passes as we need only 5 heaviest cows info.

Answer is B