3秒内给我写一个java快排

public class QuickSort {
    public static void sort(int[] nums, int left, int right) {
        if (left >= right) {
            return;
        }
        int pivot = nums[left + (right - left) / 2];
        int i = left, j = right;
        while (i <= j) {
            while (nums[i] < pivot) {
                i++;
            }
            while (nums[j] > pivot) {
                j--;
            }
            if (i <= j) {
                int temp = nums[i];
                nums[i] = nums[j];
                nums[j] = temp;
                i++;
                j--;
            }
        }
        sort(nums, left, j);
        sort(nums, i, right);
    }
}