Register

Testbook Test Series :Algorithms - TIme Complexity

• edited by
432 views
0 votes
0 votes

• edited by
User Avatar

Please log in or register to answer this question.

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

Related questions

406
views
1 answers
0 votes
rajan asked Dec 9, 2016
406 views
TestBook Test Series: Algorithms - Time Complexity
how to solve these two using matser thorem.1. t(n)=2t(√n)+n2. t(n)=4t(√n)+(logn)^2
User Avatar
2.0k
views
2 answers
1 votes
vijaycs asked Jul 11, 2016
1,972 views
TestBook Test Series: Algorithms - Time Complexity
On which of the following recurrence relation Masters theorem can not be applied ?A. T(n)= 2T(n/2) + n (log n).B. T(n) = T(n/2) + 1.C. T(n) = 8T(n/2) + (log n).D. T(n) = 7(T(n/4) + n2.
User Avatar
404
views
2 answers
0 votes
Tushar Shinde asked Jan 18, 2016
404 views
TestBook Test Series: Algorithms - Time Complexity
User Avatar
834
views
1 answers
2 votes
Akriti sood asked Jan 23, 2017
834 views
find the time complexity|testbook livetest
please tell the time complexity?i was getting O(2n)
User Avatar
Link Copied!