尝试查找我的QuickSort算法中的错误

#include <iostream>
using namespace std;

// 交换两个元素的值
void swap(int& a, int& b) {
    int temp = a;
    a = b;
    b = temp;
}

// 分割过程
int partition(int arr[], int low, int high) {
    int pivot = arr[low];  // 选择第一个元素作为分割点
    int i = low, j = high;
    
    while (i < j) {
        while (i < j && arr[j] >= pivot)
            j--;
        while (i < j && arr[i] <= pivot)
            i++;
        if (i < j)
            swap(arr[i], arr[j]);
    }
    
    swap(arr[low], arr[i]);
    return i;
}

// 快速排序
void quickSort(int arr[], int low, int high) {
    if (low < high) {
        int pivotPos = partition(arr, low, high);
        quickSort(arr, low, pivotPos - 1);
        quickSort(arr, pivotPos + 1, high);
    }
}

int main() {
    int arr[] = {5, 2, 9, 1, 7, 6, 3, 8, 4};
    int n = sizeof(arr) / sizeof(arr[0]);
    
    quickSort(arr, 0, n - 1);
    
    cout << "Sorted array: ";
    for (int i = 0; i < n; i++)
        cout << arr[i] << " ";
    
    return 0;
}