Register

Ace Test series: Algorithms - Recurrence

• edited by
529 views

1 Answer

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

Related questions

0 votes
0 votes
0 answers
2
pradeepchaudhary asked Aug 20, 2018
899 views
Master's Theorem Recurrence Relation
T (n) = T (n/2) + 2n Using Master's Method What is the Complexity Of This Recurrence Relation? Or Using AnyOther Method?
T (n) = T (n/2) + 2nUsing Master's Method What is the Complexity Of This Recurrence Relation?Or Using AnyOther Method?
User Avatar
3 votes
3 votes
1 answer
3
Ashish Sharma 3 asked Jun 16, 2017
1,757 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 confirm.
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...
User Avatar
1 votes
1 votes
2 answers
4
manvi_agarwal asked Aug 11, 2018
2,132 views
MadeEasy Subject Test: Algorithms - Recurrence
which of the following cannot be solved using masters theorem? a) T(n) = 2T(n/2) + n/logn b) T(n) = 2T(n/2) + logn c)T(n)=T(n/2)+logn d) non of these
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
User Avatar
Link Copied!