This is Quick Sort Java Code. Please add comments on each line of codes to describe what doing

import java.util.Arrays; public class QuickSort { static void Exchange(int[] A, int a, int b) { int temp = A[a-1]; A[a-1] = A[b-1]; A[b-1] = temp; }

public static int Partition(int [] A, int p, int r){ int x = A[r-1]; int i = p - 1;

for(int j = p; j<=r-1;j++) { if( A[j-1] <= x) { i = i + 1; Exchange(A, i, j); } } Exchange(A,i+1,r); return i + 1; } public static void QuickSort( int[] A, int p, int r) { if(p