如何实现一对泛型的快速排序方法？

public class QuickSort<T extends Comparable<T>> {
    public void quickSort(T[] arr) {
        if (arr == null || arr.length <= 1) {
            return;
        }
        quickSort(arr, 0, arr.length - 1);
    }

    private void quickSort(T[] arr, int low, int high) {
        if (low >= high) {
            return;
        }
        int pivotIndex = partition(arr, low, high);
        quickSort(arr, low, pivotIndex - 1);
        quickSort(arr, pivotIndex + 1, high);
    }

    private int partition(T[] arr, int low, int high) {
        T pivot = arr[low];
        int left = low + 1;
        int right = high;
        while (true) {
            while (left <= right && arr[left].compareTo(pivot) < 0) {
                left++;
            }
            while (left <= right && arr[right].compareTo(pivot) > 0) {
                right--;
            }
            if (left > right) {
                break;
            }
            swap(arr, left, right);
            left++;
            right--;
        }
        swap(arr, low, right);
        return right;
    }

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