Problem 5. Consider sorting an array a containing the following strings using me

Question

Problem 5. Consider sorting an array a containing the following strings using merge sort (code is shown below): M E R G S T P L What is a0 when the method call merge (a, aux, 0, 2, 4) returns? public static void sort (comparable Cl a) Comparable CJ aux new comparable Ca length] sort (a aux o, a length 1); private static void sort (comparable C] a, comparable aux int lo int hi) (hi lo) return int mid lo (hi lo) 2 sort (a aux, lo, mid) sort (a aux, mid 1, hi) merge (a aux lo, mid hi) private static void merge (comparable CJ a comparable CJ aux, int lo, int mid, int hi) int i lo, j mid 1 for (int k lo k hi k++) aux [k] a [k] for (int k lo k hi k++) f if (i mid) f a [k] aux CJ

Explanation / Answer

Answer:

5)Correct Answer is Option D i.e E G M R S O T X P L.

Explanation:

After the given code execution of the merge sort the order of elements we get as above.

Related Questions

Navigate

• Browse (All)
• Browse P
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.