快速排序java实现

package tao.leetcode;
/**
 * Created by Tao on 2017/7/30.
 */
public class MyLeetcode {
    public static void main(String[] args) {
        int[] list = {4,1,2,3,5};
        Solution so = new Solution();
        so.quickSort(list);
        System.out.println(" ");
    }
}

package tao.leetcode;
public class Solution {
    /**快速排序*************************/
    public void quickSort(int[] list) {
        int low = 0;
        int high = list.length - 1;
        QuickSort(list,low,high);
    }
    private void QuickSort(int[] list, int low, int high) {
        if (low < high) {
            int pivot = getPovit(list,low,high);
            QuickSort(list,low,pivot-1);
            QuickSort(list,pivot+1,high);
        }
    }
    private int getPovit(int[] list, int low, int high) {
        int flag = list[low];
        while (low < high) {
            while (low < high && list[high] >= flag) {
                high--;
            }
            list[low] = list[high];
            while (low < high && list[low] <= flag) {
                low++;
            }
            list[high] = list[low];
        }
        list[low] = flag;
        return low;
    }
}