Java 快速排序

import java.util.Arrays;

public class Qsort {
    public static void qsort(int[] array, int left, int right){
        if (left>= right){return;}
        int i = left;
        int j = right;
        int key = array[left];
        while (i < j){
            while (i < j && array[j] > key){j--;}
            while (i < j && array[i] <= key){i++;}
            if (i<j){
                swap(array, i, j);
            }
        }
        swap(array, left, i);
        qsort(array, left, i-1);
        qsort(array, i+1, right);
    }

    public static void swap(int[] array, int x, int y){
        int temp = array[x];
        array[x] = array[y];
        array[y] = temp;
    }
}