I am trying to understand how many times the statement \"x = x + 1\" is executed in the code below, as a function of \"n\":
for (i=1; i<=n; i++) for (j=1; j
The mathematical formula is here.
It is O(n^3) complexity.