快速排序

Input:
s = 7, nums = [5,3,1,7,5,20,2,4,3,2,2,1,2,4,3]
Output:
[1, 1, 2, 2, 2, 2, 3, 3, 3, 4, 4, 5, 5, 7, 20]
/*
例子：
3,8,7,1,2
2,8,7,1,3
2,3,7,1,8
2,1,7,3,8
2,1,3,7,8
    
1,2,3,7,8
*/

import java.util.Arrays;

public class test {
    public static void main(String[] args) {
        int[] nums= {5,3,1,7,5,20,2,4,3,2,2,1,2,4,3};
        quicklySort(nums,0,nums.length-1);
        //Arrays.sort(nums);
        System.out.println(Arrays.toString(nums));
    }
    public static int[] quicklySort(int[] nums,int prefix,int suffix) {
        //问题出在相同元素时不好判断//解决：相同的时候将其向前移或后移
        //问题出在换了一次之后，交换的顺序错误//解决：加入状态码
        int tempprefix=prefix;
        int tempsuffix=suffix;
        int status=0;
        if (prefix==suffix) return nums;
        
        while (prefix<suffix) {
            if (nums[prefix]>nums[suffix]) {
                swap(nums,prefix,suffix);
                status=status^1;//第一次交换状态为1
                if (status==1) {
                    prefix++;
                }else {
                    suffix--;
                }
            } else {
                if (status==1) {
                    prefix++;
                }else {
                    suffix--;
                }
            }
        }
        if (prefix==suffix) {
            quicklySort(nums, tempprefix,prefix-1);
            quicklySort(nums, suffix+1, tempsuffix);
        }
        return nums;
    }
    public static void swap(int[] nums,int prefix,int suffix) {
        int temp=nums[prefix];
        nums[prefix]=nums[suffix];
        nums[suffix]=temp;
    }
}

import java.util.Arrays;

public class test {
    public static void main(String[] args) {
        int[] nums= {5,3,1,7,5,20,2,4,3,2,2,1,2,4,3};
        nums=quicklySort(nums,0,nums.length-1);
        System.out.println(Arrays.toString(nums));
        
    }

    public static int[] quicklySort(int[] nums,int prefix,int suffix) {
        
        int centervalue=nums[(prefix+suffix)>>1];
        if (prefix>=suffix) return nums;
        
        int tempprefix=prefix-1;
        int tempsuffix=suffix+1;
        
        while (tempprefix<tempsuffix) {
            do {tempprefix++;} while (centervalue>nums[tempprefix]);
            do {tempsuffix--;} while (centervalue<nums[tempsuffix]);
            if (tempprefix<tempsuffix) {
                int temp=nums[tempprefix];
                nums[tempprefix]=nums[tempsuffix];
                nums[tempsuffix]=temp;
            }
        }
        //System.out.println(Arrays.toString(nums));
        quicklySort(nums, prefix,tempprefix-1);
        quicklySort(nums, tempsuffix+1, suffix);
        
        return nums;
    }
}