java 快速排序

package com;


/**
 * @author leon
 *
 */
public class QuickSort {

public static void main(String[] args) {
QuickSort quickSort = new QuickSort();
int arr[] = {10, 32, 1, 9, 5, 7, 12, 0, 4, 1};
quickSort.quickSort(arr, 0, arr.length - 1);
for (int i = 0; i < arr.length; i++) {
System.out.print(arr[i]);
System.out.print(",");
}
}

public void quickSort(int arr[], int low, int hight){
int left = low;
int right = hight;
if (low < hight) {
int point = arr[low];
do {
while (low < hight && point <= arr[hight])
hight--;
if (low < hight) {
arr[low] = arr[hight];
low++;
}
while (low < hight && point >= arr[low])
low++;
if (low < hight) {
arr[hight] = arr[low];
hight--;
}

} while (low < hight);
arr[low] = point;
quickSort(arr, left, low - 1);
quickSort(arr, low + 1, right);
}
}
}