question archive Imagine that Merge sort is changed so that it partitions the inputlist 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
Imagine that Merge sort is changed so that it partitions the inputlist 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
Subject:Computer SciencePrice: Bought3
Imagine that Merge sort is changed so that it partitions the inputlist 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.
