Under what case of Master’s theorem will the recurrence relation of binary search fall?
|D.||it cannot be solved using master’s theorem|
|Answer» B. 2|
|Explanation: the recurrence relation of binary search is given by t(n) = t(n/2) + o(1). so we can observe that c = logba so it will fall under case 2 of master’s theorem.|
Login to Continue
It will take less than 2 minutes