算法-快速排序

importjava.util.Arrays;
classQuicksort {
// method to find the partition positionstaticintpartition(intarray[], intlow, inthigh) {
// choose the rightmost element as pivotintpivot=array[high];
// pointer for greater elementinti= (low-1);
// traverse through all elements// compare each element with pivotfor (intj=low; j<high; j++) {
if (array[j] <=pivot) {
// if element smaller than pivot is found// swap it with the greatr element pointed by ii++;
// swapping element at i with element at jinttemp=array[i];
array[i] =array[j];
array[j] =temp;
      }
    }
// swapt the pivot element with the greater element specified by iinttemp=array[i+1];
array[i+1] =array[high];
array[high] =temp;
// return the position from where partition is donereturn (i+1);
  }
staticvoidquickSort(intarray[], intlow, inthigh) {
if (low<high) {
// find pivot element such that// elements smaller than pivot are on the left// elements greater than pivot are on the rightintpi=partition(array, low, high);
// recursive call on the left of pivotquickSort(array, low, pi-1);
// recursive call on the right of pivotquickSort(array, pi+1, high);
    }
  }
}
classMain {
publicstaticvoidmain(Stringargs[]) {
int[] data= { 8, 7, 2, 1, 0, 9, 6 };
System.out.println("Unsorted Array");
System.out.println(Arrays.toString(data));
intsize=data.length;
// call quicksort() on array dataQuicksort.quickSort(data, 0, size-1);
System.out.println("Sorted Array in Ascending Order: ");
System.out.println(Arrays.toString(data));
  }
}