Quicksort recursive implementation

Quicksort.java

class Quicksort {
    public static void main(String[] args) {
        int[] arr = new int[]{4, 6, 2, 3, 5, 8, 9, 1};
        quicksort(arr, 0, arr.length-1);
        printArr(arr);
    }

    public static void quicksort(int[] arr, int left, int right) {
        if (left < right) {
            int pivot = arr[(left + right)/2];
            int index = partition(arr, left, right, pivot);
            quicksort(arr, left, index-1);
            quicksort(arr, index, right);
        }
    }

    private static int partition(int[] arr, int left, int right, int pivot) {

        while(left <= right) {
            while(arr[left] < pivot) {
                left++;
            }

            while(arr[right] > pivot) {
                right--;
            }

            if (left <= right) {
                swap(arr, left, right);
                left++;
                right--;
            }
            printArr(arr);
        }
        return left;
    }

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

    private static void printArr(int[] arr) {
        for(int num : arr) {
            System.out.print(num + ", ");
        }
        System.out.println("");
    }
}