Register

Testbook Test Series :Algorithms - TIme Complexity

• edited by
781 views
0 0 votes

Please log in or register to answer this question.

Voting & Accepting an answer helps improve the community
← Previous · Testbook Test Series...Next → · test series
← Previous in category · https://denniskubes....Next in category → · self doubt
Position:
Show:

Related questions

0 0 votes
1 1 answer
742
742 views
rajan asked Dec 9, 2016
742 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
1 1 vote
2 answers 2 answers
2.9k
2.9k views
vijaycs asked Jul 11, 2016
2,935 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) = ...
0 0 votes
2 answers 2 answers
714
714 views
Tushar Shinde asked Jan 18, 2016
714 views
TestBook Test Series: Algorithms - Time Complexity
2 2 votes
1 answers 1 answer
2.0k
2.0k views
Akriti sood asked Jan 23, 2017
1,967 views
find the time complexity|testbook livetest
please tell the time complexity?i was getting O(2n)