(a) In what cases should Merge Sort be used? In what cases is it not efficient? Explain.(b) The following is an implementation of merge and mergeSort - Making sure to take note of the added print statement in merge, what would the following call in main print to the screen? int[] a = {4, 3, 2, 1};int[] temp = new int[a.length];mergeSort(a, 0, a.length-1, temp); public static void merge (int [] a, int start, int mid, int end, int [] temp) {int ptr1 = start;int ptr2 = mid + 1;int resPtr = start;while (ptr1 <= mid && ptr2 <= end) {System.out.println("" + a[ptr1] + "+ a[ptr2]); // Note this lineif (a[ptr1] <= a[ptr2]){temp[resPtr++] = a[ptr1++];else temp[resPtr++] = a[ptr2++];if (ptri <= mid)for (int i = ptr1; i <= mid; i++)temp[resPtr++] = a[i];elsefor (int i = ptr2; i <= end; i++)temp[resPtr++] = a[i];System.arraycopy (temp, start, a, start, end - start + 1);} |/ merge5public static void mergeSort(int [] a, int start, int end, int [] temp) {if (start < end) {int mid (start + end) / 2;mergeSort (a, start, mid, temp);mergeSort (a, mid + 1, end, temp);merge (a, start, mid, end, temp);}} // mergeSort

answer: a) merge sort needs more space to sort array than other sorting algorithm so in situations…

Answered: a) In what cases should Merge Sort be…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

(a) In what cases should Merge Sort be used? In what cases is it not efficient? Explain.
(b) The following is an implementation of merge and mergeSort - Making sure to take note of the added print statement in merge, what would the following call in main print to the screen?

int[] a = {4, 3, 2, 1};
int[] temp = new int[a.length];
mergeSort(a, 0, a.length-1, temp);