Register

Testbook Test Series :Algorithms - TIme Complexity

• edited by
407 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

0 votes
0 votes
1 answer
1
rajan asked Dec 9, 2016
381 views
TestBook Test Series: Algorithms - Time Complexity
how to solve these two using matser thorem. 1. t(n)=2t(√n)+n 2. t(n)=4t(√n)+(logn)^2
how to solve these two using matser thorem.1. t(n)=2t(√n)+n2. t(n)=4t(√n)+(logn)^2
User Avatar
1 votes
1 votes
2 answers
2
vijaycs asked Jul 11, 2016
1,902 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.
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) = ...
User Avatar
0 votes
0 votes
2 answers
3
Tushar Shinde asked Jan 18, 2016
360 views
TestBook Test Series: Algorithms - Time Complexity
User Avatar
2 votes
2 votes
1 answer
4
Akriti sood asked Jan 23, 2017
783 views
find the time complexity|testbook livetest
please tell the time complexity?i was getting O(2n)
please tell the time complexity?i was getting O(2n)
User Avatar
Link Copied!