What is the running time of the following algorithm and explain why: (Hint: one way to start approaching this is to count how many times it compares A[1] < A[2]?)

CrapSort(A):

for i = 1 to |A|

for j = 2 to |A|

if A[i] < A[j]

swap A[i] and A[j]

return CrapSort(A)