?

AP® Computer Science A

Free Version

Upgrade subject to access all content

Moderate

Merge Sort Algorithm Merging Process

APCSA-Y4MXES

Assume that you are sorting in ascending order and using a MERGE SORT algorithm.

Consider the following array.

int[ ] nums = {85, 51, 33, 40, 72, 19};

What would the array look like just before the final merge is accomplished to make it a completely sorted array?

A
[33, 51, 85, 19, 40, 72]
B
[19, 33, 40, 51, 72, 85]
C
[33, 51, 85, 40, 72, 19]
D
[85, 33, 51, 40, 72, 19]
E
[33, 51, 85, 40, 19, 72]