Register

Ace Test series: Algorithms - Recurrence

• edited by
1,074 views

1 Answer

Voting & Accepting an answer helps improve the community
← Previous · Ace Test series: Alg...Next → · Computer organisatio...
← Previous in category · Ace Test series: Alg...Next in category → · Ace Test series: Alg...
Position:
Show:

Related questions

2 2 votes
6 6 answers
26.8k
26.8k views
mohitrai0_0 asked Sep 28, 2018
26,811 views
Can we solve the recurrence T(n) = T(n/2) + 2^n by masters theorem, if possible?
I was wondering whether the recurrence T(n) = T(n/2) + 2n could be solved by using master theorem, and what would be the way. I tried solving the recurrence but can't. Th...
0 0 votes
0 0 answers
1.5k
1.5k views
pradeepchaudhary asked Aug 20, 2018
1,541 views
Master's Theorem Recurrence Relation
T (n) = T (n/2) + 2nUsing Master's Method What is the Complexity Of This Recurrence Relation?Or Using AnyOther Method?
3 3 votes
1 1 answer
2.7k
2.7k views
Ashish Sharma 3 asked Jun 16, 2017
2,704 views
Time Complexity for Recurrence relation
What will be the time complexity for the following recurrence relation?$T(n) = 8\sqrt{n} T(\sqrt{n})+(log n)^{2}$According to me it is $\Theta (n(logn)^{3})$ . Please con...
1 1 vote
2 2 answers
3.9k
3.9k views
manvi_agarwal asked Aug 11, 2018
3,947 views
MadeEasy Subject Test: Algorithms - Recurrence
which of the following cannot be solved using masters theorem?a) T(n) = 2T(n/2) + n/lognb) T(n) = 2T(n/2) + lognc)T(n)=T(n/2)+lognd) non of these