The picture below is a java function, what is the worst-case run time of this algorithm?

Please show the detailed analysis process!

public static int CountInversions(int[] A){ int result = 0; for(int i = (A.length-1); i > 0; i--){ int j = i; while(A[j-1] > A[j]){ int temp = A[j]; A[j] = A[j-1]; A[j-1] = temp; if(i