Calculate the time complexity of the sorting algorithm from psuedo-code to find for the number of comparisons using summation. (IE, (n), (n^2), etc)

for i = 0 to n-2 {

for j = 0 to n-2 {

if A[ j ] > A[ j + 1] {

swap(A[ j ], A[ j + 1])

}

}

}

Heres a screenshot since formatting won't let me post properly:

for i = @to n-2 { for j = @to n-2 { if A[ 3 ] > A[ j + 1] { swap(A[ j ], A[ j + 1]) 3 } 2 3 }