567 views

4 Answers

Best answer
2 votes
2 votes

from Master's Theorem we get: T(n) = O($n^{\log_{4}5}$)

Now:$\log_{4}5 = \frac{\log_{2} 5}{\log_{2} 4} = \frac{\log_{2} 5}{2\log_{2} 2} = \frac{1}{2}\times \frac{\log_{2} 5}{\log_{2} 2} = \frac{\log_{2} 5^{1/2}}{\log_{2} 2} = \frac{\log_{2} 5^{1/2}}{1} = \log 5^{1/2}$

T(n) = O($n^{\log5^{1/2}}$)

Answer should be B

selected by
0 votes
0 votes

T(n) =O( nlog 5 4)

T(n) = O(n2)

option D is right

0 votes
0 votes

Using Master's Algo : 

a=5,b=4,k=1,p=0;

a>bk

So, Complexicity = O(nlogba)= O(nlog45)=O(n2) Approx.

Answer:

Related questions

0 votes
0 votes
1 answer
1
Aakash1125 asked Apr 30, 2017
554 views
What is this statement means ?? what is correct option??
0 votes
0 votes
0 answers
3
–1 votes
–1 votes
0 answers
4
sumit_kumar asked Jul 3, 2017
217 views