快速排序

public class QuickSort {
    public static void main(String[] args) {
        // TODO Auto-generated method stub
        int size = 10;
        int[] a = new int[size];
        for(int i = 0; i < size; i++)
            a[i] = (int)(Math.random()*10);
        print(a);
        quickSort(a, 0, size-1);
        print(a);
    }

    public static void print(int[] a) {
        for(int i = 0; i < a.length; i++)
            System.out.print(a[i] + " ");
        System.out.println();
    }

    public static void quickSort(int[] a, int low, int high) {
        if(low < high) {
            int i = low, j = high, x = a[low];
            while(i < j) {
                while(a[j] >= x && i < j) {
                    j--;
                }
                if(i < j) {
                    a[i++] = a[j];
                }
                while(a[i] <= x && i < j) {
                    i++; 
                }
                if(i < j) {
                    a[j--] = a[i];
                }
            }
            a[i] = x;
            quickSort(a, low, i-1);
            quickSort(a, i+1, high);
        }
    }
}