Quicksort algorithm

Quicksort.java

public void quickSort(int[] array) {
    quickSort(array, 0, array.length - 1);
}

public void quickSort(int[] array, int left, int right) {
    int pivotIndex = partition(array, left, right);
    if (left < pivotIndex - 1) {
        quickSort(array, left, pivotIndex - 1);
    }
    if (right > pivotIndex) {
        quickSort(array, pivotIndex, right);
    }
}

public static int partition(int[] array, int left, int right) {
    int pivot = array[left+ (right-left)/2];
    while (left <= right) {
        while (array[left] < pivot) {
            left++;
        }
        while (array[right] > pivot) {
            right--;
        }
        if (left <= right) {
            int tmp = array[left];
            array[left] = array[right];
            array[right] = tmp;
            left++;
            right--;
        }
    }
    return left;
}