What is the complexity of this nested triple for loop?

Question

I have searched a bit on StackOverflow and have understood the complexity up to the point of the j-loop, which is O(n2). However with the nested addi

Answer 1

Take a look at this example for evaluating worst case complexity.

In essence, if you evaluate it line by line, you will get to something like O(n^3 / C), where C is some constant, normally skipped in such evaluations, leading to O(n^3).