The merge sort algorithm presented in section 14.4, which sorts an array of integers in ascending order, uses the merge method which is partially shown below.Select the condition that would be needed to complete the method so that the elements are sorted in descending order. A)first[iFirst] second[iSecond] B)first[iFirst] iSecond D)iFirst

Question

The merge sort algorithm presented in section 14.4, which sorts an array of integers in ascending order, uses the merge method which is partially shown below.Select the condition that would be needed to complete the method so that the elements are sorted in descending order. A)first[iFirst] > second[iSecond] B)first[iFirst] < second[iSecond] C)iFirst > iSecond D)iFirst < iSecond

Quizplus · Accepted Answer

To sort the elements in descending order, we need to compare the elements in decreasing order. In the merge method, the comparison is done with the condition first[iFirst] < second[iSecond], which compares elements in increasing order. To compare elements in decreasing order, we need to change this condition to first[iFirst] > second[iSecond]. Thus, choice A is the correct option.

The Merge Sort Algorithm Presented in Section 14