Imagine that Merge sort is changed so that it partitions the input list into 3 sub-lists instead
Fantastic news! We've Found the answer you've been seeking!
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 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.?
Related Book For
Introduction to Algorithms
ISBN: 978-0262033848
3rd edition
Authors: Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest
Posted Date: