双轴QuickSort

public class DualPivotQuickSort {
    public static void sort(int[] arr) {
        sort(arr, 0, arr.length - 1);
    }

    private static void sort(int[] arr, int left, int right) {
        if (left < right) {
            int[] pivots = partition(arr, left, right);
            sort(arr, left, pivots[0] - 1);
            sort(arr, pivots[0] + 1, pivots[1] - 1);
            sort(arr, pivots[1] + 1, right);
        }
    }

    private static int[] partition(int[] arr, int left, int right) {
        if (arr[left] > arr[right]) {
            swap(arr, left, right);
        }
        int pivot1 = arr[left];
        int pivot2 = arr[right];

        int i = left + 1;
        int j = right - 1;
        int k = left + 1;

        while (k <= j) {
            if (arr[k] < pivot1) {
                swap(arr, i++, k++);
            } else if (arr[k] >= pivot2) {
                while (arr[j] > pivot2 && k < j) {
                    j--;
                }
                swap(arr, k, j--);
            } else {
                k++;
            }
        }
        i--;
        j++;

        swap(arr, left, i);
        swap(arr, right, j);

        return new int[]{i, j};
    }

    private static void swap(int[] arr, int i, int j) {
        int temp = arr[i];
        arr[i] = arr[j];
        arr[j] = temp;
    }

    public static void main(String[] args) {
        int[] arr = {5, 3, 8, 4, 2, 7, 1, 10};
        sort(arr);
        for (int num : arr) {
            System.out.print(num + " ");
        }
    }
}