Quick Sort

Given an Array, sort the array using the Quick sort algorithm. NOTE: Don’t use any inbuilt methods/libraries.

public class QuickSort {
    public static void quickSort(int[] array, int low, int high) {
        if (low < high) {
            
            int pi = partition(array, low, high);
            quickSort(array, low, pi - 1);
            quickSort(array, pi + 1, high);
        }
    }

    public static int partition(int[] array, int low, int high) {
        int pivot = array[high];
        int i = (low - 1); 

        for (int j = low; j < high; j++) {
            if (array[j] <= pivot) {
                i++;
                int temp = array[i];
                array[i] = array[j];
                array[j] = temp;
            }
        }

        int temp = array[i + 1];
        array[i + 1] = array[high];
        array[high] = temp;

        return i + 1;
    }

    
    public static void printArray(int[] array) {
        int n = array.length;
        for (int i = 0; i < n; ++i)
            System.out.print(array[i] + " ");
        System.out.println();
    }

    // Main method
    public static void main(String[] args) {
        int[] array = {10, 7, 8, 9, 1, 5};
        int n = array.length;
        System.out.println("Given Array");
        printArray(array);

        quickSort(array, 0, n - 1);

        System.out.println("\nSorted array");
        printArray(array);
    }
}