Time Complexity

Question

can you find the time complexity of this code with full solution?

(This is an exercise for those who want to practice getting the time complexity of algorithms...)

code:

***
for (int i = 1; i <= n; i++)
for (int j = 1; j <= i; j++)
for (int k = 1; k <= j; k++)
x++;
***

T(n) = n^3

Answer 1

Is that your homework?

Answer 2

Yes, and you can find it on Google yourself.

Answer 3

Jerry Hobby No, in fact, I asked this question to challenge people as the first question of my discuss. I edited the description of my question for better clarity...

Answer 4

Jan why google when we can use chatgpt? ;)

Answer 5

AraL That's right, but anyway, I found it quite quickly on Google.