java快速排序

/**
 * Created by huazi on 16/8/8.
 */
public class KSPX {
    public static void main(String[] args) {

        int Array[] = {1, 22, 5, 7, 14, 8};
        quick(Array);
        for (int i = 0; i <Array.length ; i++) {
            System.out.println(Array[i]);
        }

    }

    public static int getMiddle(int arr[], int low, int high) {

        int tmp = arr[low];    //數組的第一個做爲中軸  
        while (low < high) {
            while (low < high && arr[high] > tmp) {
                high--;
            }
            arr[low] = arr[high];   //比中軸小的記錄移到低端  
            while (low < high && arr[low] < tmp) {
                low++;
            }
            arr[high] = arr[low];   //比中軸大的記錄移到高端  
        }
        arr[low] = tmp;              //中軸記錄到尾  
        return low;
    }
    public static void _quickSort(int[] list, int low, int high) {
        if (low < high) {
            int middle = getMiddle(list, low, high);  //將list數組進行一分爲二
            _quickSort(list, low, middle - 1);        //對低字表進行遞歸排序
            _quickSort(list, middle + 1, high);       //對高字表進行遞歸排序
        }
    }

    public static void quick(int[] str) {
        if (str.length > 0) {    //查看數組是否爲空
            _quickSort(str, 0, str.length - 1);
        }
    }
}