The Merge Sort Algorithm Presented in Section 14

question 107

Multiple Choice

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. private static void merge(int[] first, int[] second, int[] A) {
Int iFirst = 0;
Int iSecond = 0;
Int j = 0;
While (iFirst < first.length && iSecond < second.length)
{
If (_____________________________)
{
A[j] = first[iFirst];
IFirst++;
}
Else
{
A[j] = second[iSecond];
ISecond++;
}
J++;
}
// rest of the method follows here
}

• A) first[iFirst] < second[iSecond]
• B) iFirst < iSecond
• C) first[iFirst] > second[iSecond]
• D) iFirst > iSecond

---

Definitions:

Week

A time unit consisting of seven days.

Probability

A measure of the likelihood that an event will occur, expressed as a number between 0 and 1 where 0 indicates impossibility and 1 indicates certainty.

Flipping

The act of turning something over to its opposite side or changing its position, often used metaphorically to describe a dramatic change in perspective or situation.

Quarter

A three-month period on a financial calendar that acts as a basis for periodic financial reporting and dividend payments.