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}
Instead Of 2 And Then Calls Merge40 Recursively 4 Times All The Other Steps In Merge40 Remain The Same Like Normal Mer 1 (22.85 KiB) Viewed 40 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)
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!