[排序算法复习]快速排序的简单实现方法

复习快速排序，参考的是力扣大佬的代码，在此做下记录。

import java.util.Random;

class Solution {
    /**
     * 排序算法入口
     *
     * @param nums 待排序数组
     */
    public int[] sortArray(int[] nums) {
        int len = nums.length;
        quicksort(nums, 0, len - 1);
        return nums;
    }

    private void quicksort(int[] nums, int left, int right) {
        if (left < right) {
            int pivot = partition(nums, left, right);
            quicksort(nums, left, pivot - 1);
            quicksort(nums, pivot + 1, right);
        }
    }

    private int partition(int[] nums, int left, int right) {
        int randomIndex = new Random().nextInt(right - left + 1) + left;
        swap(nums, left, randomIndex);

        int pivot = nums[left];
        int lt = left;
        for (int i = left + 1; i <= right; i++) {
            if (nums[i] < pivot) {
                lt++;
                swap(nums, i, lt);
            }
        }
        swap(nums, lt, left);
        return lt;
    }


    void swap(int[] nums, int a, int b) {
        int tmp = nums[b];
        nums[b] = nums[a];
        nums[a] = tmp;
    }
}