The elements in a long array of integers are roughly sorted in decreasing order. No more than 5 percent of the elements are out
of order. Which of the following is the best method to use to sort the array in descending order? I. Insertion sort.
Il. Merge Sort.
III. Heap Sort.
a. Ill only.
b. I only.
c. II and III only.
d. I and II only.
e. Il only I and.
f. Ill only.
The best method to use to sort the array in descending order is:
e. Il only
Explanation:
The Merge Sort is similar to the Insertion Sort but, it is better with its sorting versatility. It repeatedly breaks down a list into several sub-lists until each sub-list consists of a single element and then, merging the sub-lists in a manner that results in a sorted list. The Merge Sort has been described as a "divide and conquer" technique because of how it splits a list into equal halves before combining them into a sorted whole.
