retagged by
451 views

2 Answers

0 votes
0 votes

T(n)=5T(n/2)+n^2
Applying master theorem ,
a=5 b=2

f(n)=n2= O(nlogba-¢) = O(nlog25-1) = O(n2)            Case : 1
So complexity is O(nlog25)

0 votes
0 votes

master theorem

T(n)=5T(n/2)+n^2

a=5,b=2,K=1,P=0

Case 1: if a>bk, then T(n)=O(nlogba)

                                                            T(n)=O(nlog25 )

Related questions

1 votes
1 votes
0 answers
1
syncronizing asked Mar 15, 2019
1,298 views
Is this the correct way to solve ?Q) int algorithm(int n){ int sum =0;k,j; for (k=0;k<n/2;k++) for(j=0;j<10;j++) sum++; return 4*algorithm(n/2)*algorit...
1 votes
1 votes
1 answer
2
VikramRB asked Jan 20, 2019
1,041 views
What is the time complexity of the following recurrence relation and step to derive the same$T(n) = T(\sqrt{n}) + log(logn)$
0 votes
0 votes
0 answers
4
garvit_vijai asked Nov 17, 2018
467 views
How to solve the following recurrence relation?T(n) = T(n-6) + n2 , n>7T(n) = 1 , n<= 7