Question: Consider a version of merge sort in which an array of size n is divided into 6 segments of sizes n/ 6. Write the recurrance
Consider a version of merge sort in which an array of size n is divided into 6 segments of sizes n/6. Write the recurrance relation for the time complexity and solve it. (Show all your work. You can assume n = 6k, and T(1) = 1.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
