快速排序

    public void QuickSort(int[] nums,int low,int high){        if(low<high){            int point=Partition(nums,low,high);            QuickSort(nums,low,point-1);            QuickSort(nums,point+1,high);        }    }    public int Partition(int[] nums,int low,int high){        int key=nums[low];        while(low<high){            while(low<high&&nums[high]>=key) high--;            nums[low]=nums[high];            while(low<high&&nums[low]<=key) low++;            nums[high]=nums[low];        }        nums[low]=key;        return low;    }