In each iteration in the inner loop, there is 1 operation.

We consider comparison as the operation to be analyzed

There are (1+2+⋯+(n−1))+2(n−1)+1(1+2+\cdots+(n-1)) + 2(n-1)+1 operation.

The complexity of this algorithm is O(n2)O( n^2 )

The inner loop is a while loop for variable jj and the number of iterations is n−i−1n-i-1.

The outer loop is a for loop for variable ii and the number of iterations is n−1n-1.

The pseudocode contains a nested loop.