Question: We change the merge-sort algorithm by letting mid = left + (right - left)/5. Rest of the algorithm remains the same as described in notes.
We change the merge-sort algorithm by letting mid = left + (right - left)/5. Rest of the algorithm remains the same as described in notes. State the recurrence relation for the worst-case Big-O complexity of this modified merge-sort algorithm.
Hint: This cannot be solved using the Master Theorem.
Rubric:
8 points for the recursive part.
2 points for the work outside of recursion.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
