Register

asymptotic complexity of iterative loops
closed

• closed by
298 views
0 votes
0 votes
closed as a duplicate of: MIT ASSIGNMENT
Hii guys.Someone please have a look at this and tell me if I got it right.

for(i=1;i<=n;i++)

for(j=1;j<=i^2;j++)

for(k=1;k<=j;k++)

printf("welcome");

what is the time complexity? I got it to be O(n^4).
• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
0 answers
1
usdid asked Apr 16, 2022
279 views
a) what is the iterative equation showing the running time of the algorithm whose pseudocode is given below? b) What is this repeated equation in asymptotic notation using the Master's theorem. c) What is the same repeated equation in asymptotic notation using the recursion tree method.
a) what is the iterative equation showing the running time of the algorithm whose pseudocode is given below? b) What is this repeated equation in asymptotic notation usin...
User Avatar
1 votes
1 votes
3 answers
2
Manu Thakur asked Aug 29, 2017
2,898 views
Time Complexity of Iterative Program
The innermost loop will execute when j is multiple of i, and that will happen exactly i times. Please help me to find the time complexity of the below program:
The innermost loop will execute when j is multiple of i, and that will happen exactly i times. Please help me to find the time complexity of the below program:
User Avatar
1 votes
1 votes
2 answers
3
sh!va asked Dec 4, 2016
997 views
Find the time complexity of given loops
for (int i = 1; i <=m; i += c) { ---do something ---} for (int i = 1; i <=n; i += c) { ---do something --- } What will the the tiem complexity of given code pseudococde? A. O (max(m,n)) B. O(min(m,n)) C. O( m+n) D. O(mn)
for (int i = 1; i <=m; i += c){ -do something -}for (int i = 1; i <=n; i += c){ -do something - }What will the the tiem complexity of given code pseudococde?A. O (m...
User Avatar
2 votes
2 votes
3 answers
4
Meenakshi Sharma asked Sep 4, 2016
1,909 views
time complexity of for loops
For(I=1 ; I<=n ; I++) { For(J=1 ; J<=I ; J++) { For(K=1 ; K<=n^5 ; K=15 × K) { x=y+z; } } } What is the time complexity of above code ?
For(I=1 ; I<=n ; I++) { For(J=1 ; J<=I ; J++) { For(K=1 ; K<=n^5 ; K=15 × K) { x=y+z; } } }What is the time complexity of above code ?
User Avatar
Link Copied!