Question: Assume that that after analysizng a recursive function to find it's T(n) you find that T(n) = 1 + 2 * T(n/4) What is the

Assume that that after analysizng a recursive function to find it's T(n) you find that

T(n) = 1 + 2 * T(n/4) 

What is the big O performance of this function? Is it faster or slower than binay search? Is it faster or slowe than merge sort?

Hint: a ^ ( log x in base a^k) = x^(1/k)

Step by Step Solution

3.46 Rating (159 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

The big O performance of the recursive ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!