I would like some help in understanding on how we go about solving these kind of problems where we are given sample code/pseudo code and then find the running times.

From my attempt, this pseudocode would translate to:

And so we would get

Now I am not sure if what I have so far is correct, but where I get confused is how we get the best / average for code/pseudocode like this.

So I would like a step by step explanation on how you would go about solving this, and problems like this in general. Thanks!

Consider the following pseudo code: at0 for i0 to n*n do for j0 to i do a ai Which of the following characterization, in terms of n, of the running time of the above code is not correct? O(n3)