Quickly sort Java code

/*explanation URLhttp://wenku.baidu.com/link?url=1xofQsF1043cyk06D7L_OWOJUna67Lx3GNK9Qg6HbADlRH_ Tmnlx-3evvlrtvuvqa9c442x576vsalq8ytp8v7o9p7c_vtibm7gd_08wye3*/ PackageQuickSort;/*** Quick Sort *@authorAdministrator **/ Public classQuickSort {voidSwapint[] A,intIintj) {        inttemp; Temp=A[i]; A[i]=A[j]; A[J]=temp; }        intPosint[] A,intLowintHigh ) {        inttemp=a[low],i=low,j=High ;  while(i<j) {             while(i<j) {                 while((a[j]>=temp) && (i<j)) {J--; }                if(i<j)                    {swap (A,I,J); I++; }                 while((a[i]<=temp) && (i<j)) {i++; }                if(i<j)                    {swap (A,I,J); J--; }            }        }        returni; }        voidQuickSort (int[] A,intLowintHigh ) {        intPOS; if(low<High ) {POS=POS (A,low,high); QuickSort (A,low,pos-1); QuickSort (A,pos+1, high); }    }} PackageQuickSort;/*** Test class *@authorAdministrator **/ Public classTest { Public Static voidMain (string[] args) {Final intN= (int) (Math.random () *100+1); QuickSort Q=NewQuickSort (); int[] A=New int[N];  for(intj=0;j<n;j++) {A[j]=(int) (Math.random () *100); } System.out.println ("Before sorting:");  for(inti=0;i<a.length;i++) {System.out.print (A[i]+" "); } q.quicksort (A,0,a.length-1); System.out.println ("After sorting:");  for(inti=0;i<a.length;i++) {System.out.print (A[i]+" "); }    }}

Quickly sort Java code