150 views
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).

### 3 Comments

I am getting $\sum_{I=1}^{n}i^{4}$
I did it many times and finally found O(n^5) to be the resulting dominant term in the expansion of summation . Still not sure though

0 votes
0 answers
1
148 views
1 vote
2 answers
2
613 views
2 votes
3 answers
3
1,498 views
0 votes
1 answer
4
214 views