快速排序java实现

    public int[] sortArray(int[] nums){
        quicksort(nums,0, nums.length-1);
        return nums;
    }

    public void quicksort(int[] nums,int start,int end){
        if (end>start)
        {
            int pivot=partiton(nums,start,end);
            quicksort(nums,start,pivot-1);
            quicksort(nums,pivot+1,end);
        }
    }

    private int partition (int[] nums,int start,int end){
        int random=new Random().nextInt(end-start+1)+start;
        swap(nums,random,end);

        int small=start-1;
        for (int i=start;i