快速排序的Java实现

package quicksort;

import org.junit.Test;

import java.util.Arrays;

public class QuickSort {

    @Test
    public void setUp() throws Exception {
        int[] arr = new int[]{32, 26, 83, 55, 42, 67, 73, 92, 60};
        quickSort(arr, 0, arr.length - 1);
        System.out.println(Arrays.toString(arr));
    }

    public void quickSort(int[] arr, int low, int high) {
        if (low < high) {
            int temp = quickPartition(arr, low, high);
            quickSort(arr, low, temp - 1);
            quickSort(arr, temp + 1, high);
        }
    }

    public int quickPartition(int[] arr, int low, int high) {
        int key = arr[low];
        while (low < high) {
            while (low < high && arr[high] >= key) {
                high--;
            }
            arr[low] = arr[high];
            while (low < high && arr[low] <= key) {
                low++;
            }
            arr[high] = arr[low];
        }
        arr[low] = key;
        return low;
    }
}