quick sort

#include <iostream>
using namespace std;

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

    for (int j = low; j < high; j++) {
        if (arr[j] < pivot) {
            i++;
            swap(arr[i], arr[j]);
        }
    }
    swap(arr[i + 1], arr[high]);
    return i + 1;
}

void quickSort(int arr[], int low, int high) {
    if (low < high) {
        int pi = partition(arr, low, high);
        quickSort(arr, low, pi - 1);
        quickSort(arr, pi + 1, high);
    }
}

int main() {
    int arr[] = {10, 7, 8, 9, 1, 5};
    int n = 6;

    cout << "Original array: ";
    for (int i = 0; i < n; i++) cout << arr[i] << " ";

    quickSort(arr, 0, n - 1);

    cout << "\nSorted array (Quick Sort): ";
    for (int i = 0; i < n; i++) cout << arr[i] << " ";

    cout << "\n\nTime Complexity: O(n log n) (average), O(n^2) (worst)\nSpace Complexity: O(log n)\n";
    return 0;
}