search
Log In
2 votes
131 views

Solve this problem? 

in Algorithms 131 views

1 Answer

6 votes
 
Best answer

T(n)=4T(n0.5) +(logn)2
put n=2k
T(2k)=4T(2k/2) +(k)2
make T(2k)=s(k)
s(k)=4s(k/2) +(k)2     use master thm 2nd case
klogba=klog24 =k2  
tc=theta(k2 logk) put k=logn
tc=theta((logn)2.loglogn)


edited by
0
Thanks Saurabh..

i got it.

Related questions

1 vote
0 answers
1
33 views asked Dec 28, 2017 in Algorithms Abhijeet_Kumar 33 views
0 votes
1 answer
2
265 views
Best algorithm for this set: 1.Independently sorting each of 1,000,000 arrays, each with 5 elements. 2.Sorting a set of 4,000,000 numbers in worst case O(n lg n) time.
asked Feb 3, 2017 in Algorithms Smriti012 265 views
2 votes
0 answers
3
66 views
How to solve this time complexity question?
asked Jan 5, 2017 in Algorithms Deepak Yadav 66 views
3 votes
0 answers
4
88 views
Time complexity. .
asked Jan 5, 2017 in Algorithms Deepak Yadav 88 views
...