Question: What is the T(n) recurrence relation for merge sort? A. T(n) = T(n/2) + T(n/2) + n B. T(n) = T(n/2) = T(n/2) C. T(n)
What is the T(n) recurrence relation for merge sort?
A. T(n) = T(n/2) + T(n/2) + n
B. T(n) = T(n/2) = T(n/2)
C. T(n) = 3*T(n/2) +2*T(n/2)+n
D. Not enough information
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
