Question: ! When we analyze the MergeSort with the Master Theorem, why do we say that d is 1? 1. It takes (n1) steps to partition
!
When we analyze the MergeSort with the Master Theorem, why do we say that d is 1?
1. It takes (n1) steps to partition the list so that the pivot is in the appropriate place.
2. None of the other choices are correct.
3. The depth of recursion is 1 in the average case.
4. It takes only one step to find the middle of the list.
5. The depth of recursion is 1 in the worst case.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
