快排都用上了做不了啊！！！

#include <iostream>
using namespace std;

int partition(int *arr,int l,int r){
    int pivot = arr[l];
    int i = l,j = r;s
    while(i < j){
        while(i < j && arr[j] >= pivot){
            j -= 1;
        }
        arr[i] = arr[j];
        while(i < j && arr[i] <= pivot){
            i += 1;
        }
        arr[j] = arr[i];
    }
    arr[i] = pivot;
    return i;
}
void quickSort(int *arr,int l,int r){
    if(l >= r) return ;
    int pos = partition(arr,l,r);
    quickSort(arr,l,pos-1);
    quickSort(arr,pos+1,r);
}

int main(){
    int n,m;
    cin >> n;
    int *arr = (int *)malloc(sizeof(int)*n); // new int[n]
    for(int i=0;i<n;i++){
        cin >> arr[i];
    }
    cin >> m;
    quickSort(arr,0,n-1);
    for(int i=0;i<n;i++){
        cout << arr[i] << ' ';
    }
    return 0;
}