Register

TestBook Test Series: Algorithms - Time Complexity

• edited by
358 views

2 Answers

Best answer
1 votes
1 votes
FIRST LOOP:intializes i=1 SECOND LOOP:intializes i=1; THIRD LOOP intializes i=1 and run till i=n^6 .. and when i checks for second iteration for 1st loop get.. condition failed ..and loops out ... THATS WHY ONLY n^6 times it get printed.
• selected by
User Avatar
1 votes
1 votes
HERE N^6 IS THE ANSWER BECAUSE  every time variable i is initialized to 1 and so the previous 2 i values are ignored and the final loop is taken in consideration. this is what i think
User Avatar
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
373 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,892 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
0 answers
3
sidlewis asked Sep 1, 2018
405 views
Testbook Test Series :Algorithms - TIme Complexity
User Avatar
2 votes
2 votes
1 answer
4
Akriti sood asked Jan 23, 2017
760 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!