快排

public class MyQuickSort {


    public static void quickSort(int[] arr, int left, int right) {
        if (left >= right) {
            return;
        }
        int i = left;
        int j = right;
        int key = arr[left];

        while (i != j) {
            while (arr[j] >= key && i < j) {
                j--;
            }
            while (arr[i] <= key && i < j) {
                i++;
            }
            int temp = arr[i];
            arr[i] = arr[j];
            arr[j] = temp;
        }
        arr[left] = arr[i];
        arr[i] = key;
        quickSort(arr, left, i-1);
        quickSort(arr, j+1, right);
    }

    public static void main(String[] args) {
        int[] arr = new int[]{3, 6, 78, 78, 56, 734, 1, 2, 3, 89, 0, -1};
        quickSort(arr, 0, arr.length - 1);
        System.out.println(Arrays.toString(arr));


    }
}