Register

Algorithm Complexity problem

672 views
1 votes
1 votes
T(n) = 4T(sqrt(n)) + (logn)^5

Find Time complexity.(n=2^k)

Give detailed answer , how to derive it.
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
3 answers
1
Anmol Verma asked Jan 9, 2017
1,498 views
time complexity Master's Theorem problem from CLRS
1) T(n)=T(n-1)+1/n. 2) T(n)=T(n-1) +1/log(n) 3)T(n)=3T((n/3) - 2)+n/2. 4)T(n)=T(n/2)+T(n/4)+T(n/8)+n. Use Masters theorem
1) T(n)=T(n-1)+1/n.2) T(n)=T(n-1) +1/log(n)3)T(n)=3T((n/3) - 2)+n/2.4)T(n)=T(n/2)+T(n/4)+T(n/8)+n.Use Masters theorem
User Avatar
0 votes
0 votes
2 answers
2
rahul sharma 5 asked Dec 14, 2016
499 views
Master Theorem Algorithm
How is master theorem applicable here?
How is master theorem applicable here?
User Avatar
1 votes
1 votes
2 answers
3
Rahul Jain25 asked Oct 7, 2016
601 views
Algorithm Time compleity
User Avatar
7 votes
7 votes
3 answers
4
bts asked May 29, 2018
1,881 views
Time complexity , Recursion
Why is recursive equation of following code $T(n)=T(n/2)+O(1)$, not $T(n)=8*T(n/2)+O(1)$? int x=0; int A(n) { if(n==1) return 1; else { X+=8A(n/2)+n^3; } return X; }
Why is recursive equation of following code $T(n)=T(n/2)+O(1)$, not $T(n)=8*T(n/2)+O(1)$? int x=0; int A(n) { if(n==1) return 1; else { X+=8A(n/2)+n^3; } return X; }
User Avatar
Link Copied!