How can I implement Quick Sort in Java?

How can I implement Quick Sort in Java?

You can implement Quick Sort in Java using a recursive method. Would you like to see a code example?

Yes, please show me the code.

Here's a simple implementation:

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

    private 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;
    }
}

Would you like an explanation of how this works?

Yes, that would be great!

In this implementation, the quickSort method recursively sorts the array. The partition method selects a pivot and rearranges the array so that elements less than the pivot come before it and those greater come after. This process continues until the base case is reached.