5.快排（不稳定）

public static  int Partition(int[] nums,int left,int right){

        int prvot=nums[left];
        while (left<right)
        {
            while (left<right&&nums[right]>=nums[left])right--;
            nums[left]=nums[right];
            while (left<right&&nums[left]<=nums[right])left++;
            nums[right]=nums[left];


        }
        nums[left]=prvot;
        return left;
    }
    public static void   QuickSort(int[] nums,int left,int right){
        if(left<right)
        {
            int partition = Partition(nums, left, right);
            QuickSort(nums,left,partition-1);
            QuickSort(nums,partition+1,right);

        }





    }