Quick Sort

1. Choose a pivot element (commonly last, first, or median)
2. Partition: rearrange array so elements smaller than pivot are on left, larger on right
3. The pivot is now in its final sorted position
4. Recursively apply quicksort to left and right subarrays
5. Base case: subarrays with 0 or 1 elements are sorted

quickSort(arr, low, high):
    if low < high:
        pivotIndex = partition(arr, low, high)
        quickSort(arr, low, pivotIndex - 1)
        quickSort(arr, pivotIndex + 1, high)

partition(arr, low, high):
    pivot = arr[high]
    i = low - 1
    for j = low to high - 1:
        if arr[j] < pivot:
            i++
            swap(arr[i], arr[j])
    swap(arr[i+1], arr[high])
    return i + 1