Page 1 of 1
John proposes a new extension of merge sort algorithm calls merge4 that divide and split the unsorted data to 4 instead
Posted: Fri May 20, 2022 6:41 pm
by answerhappygod
- John Proposes A New Extension Of Merge Sort Algorithm Calls Merge4 That Divide And Split The Unsorted Data To 4 Instead 1 (27.55 KiB) Viewed 72 times
John proposes a new extension of merge sort algorithm calls merge4 that divide and split the unsorted data to 4 instead of 2, and then calls merge40) recursively 4 times. All the other steps in merge40) remain the same like normal merge sort algorithm. a. Illustrate the steps involved in using merge4 sort for the following sequence using a figure. (6 marks) S={241,103,50,221,500,800,70,101) b. What is the time complexity of merge4 algorithm? (2 marks)