Question

A professor proposed a new sorting algorithm that works like merge-sort but does not require merge. It works like the following: Given an array a of n elements. Sort the first 2/3 of a; sort the last 2/3 of a; sort the first of 2/3 of a; return a as a sorted array. The base case is an array of less than or equal to 8 elements, for which we will sort it using insertion sort. The pseudo code is shown below. No_merge_merge_sort(a) { if (a.size() > 8) { No_merge_merge_sort(first 2/3 of a): No_merge_merge_sort(last 2/3 of a): No_merge_merge_sort(first 2/3 of a): } else } Insertion_sort (a); a. Use a recurrent to describe the time complexity of the algorithm. b. Solve the recurrence using the Master method. c. What's the advantage and disadvantage of the proposed algorithm comparing with merge-sort in terms of both time and space complexity? Justify your answer.

          A professor proposed a new sorting algorithm that works like merge-sort but does not require
merge. It works like the following: Given an array a of n elements. Sort the first 2/3 of a; sort the last
2/3 of a; sort the first of 2/3 of a; return a as a sorted array. The base case is an array of less than or
equal to 8 elements, for which we will sort it using insertion sort. The pseudo code is shown below.
No_merge_merge_sort(a) {
if (a.size() > 8) {
No_merge_merge_sort(first 2/3 of a):
No_merge_merge_sort(last 2/3 of a):
No_merge_merge_sort(first 2/3 of a):
} else
}
Insertion_sort (a);
a. Use a recurrent to describe the time complexity of the algorithm.
b. Solve the recurrence using the Master method.
c. What's the advantage and disadvantage of the proposed algorithm comparing with merge-sort
in terms of both time and space complexity? Justify your answer.

A professor proposed a new sorting algorithm that works like merge-sort but does not require
merge. It works like the following: Given an array a of n elements. Sort the first 2/3 of a; sort the last
2/3 of a; sort the first of 2/3 of a; return a as a sorted array. The base case is an array of less than or
equal to 8 elements, for which we will sort it using insertion sort. The pseudo code is shown below.
Nomergemergesort(a)
if (a.size() > 8)
Nomergemergesort(first 2/3 of a):
Nomergemergesort(last 2/3 of a):
Nomergemergesort(first 2/3 of a):
else

Insertionsort (a);
a. Use a recurrent to describe the time complexity of the algorithm.
b. Solve the recurrence using the Master method.
c. What's the advantage and disadvantage of the proposed algorithm comparing with merge-sort
in terms of both time and space complexity? Justify your answer.

Added by Justin C.

Question

Please give Ace some feedback