Question: Imagine that Merge sort is changed so that it partitions the input list into 3 sub-lists instead of just 2, that it recursively calls Merge

Imagine that Merge sort is changed so that it partitions the input list into 3 sub-lists instead of just 2, that it recursively calls Merge sort on each of these three lists and that it then calls a Merge subroutine on the 3 sorted lists to merge them into a single sorted list. Assume that this Merge subroutine works in n time where n is the total number of elements in all 3 lists. Write recurrence relation for the run time of this new version of Merge sort.?


Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Algorithms Questions!