quicksort

#include<iostream>
using namespace std;
int partition(int arr[],int l,int r){
    int pi=arr[r];
    int i=l-1;
    for(int j=l;j<r;j++){
        if(arr[j]<pi){
            i++;
             int temp=arr[i];
             arr[i]=arr[j];
             arr[j]=temp;
        }
    }
    int temp=arr[i+1];
    arr[i+1]=arr[r];
    arr[r]=temp;
    return i+1;
}
void quicksort(int arr[],int l,int r){
    if(l<r){
        int pi=partition(arr,l,r);
        quicksort(arr,l,pi-1);
        quicksort(arr,pi+1,r);
    }
}
int main(){
    int n;
    printf("Enter no. of element you want:");
    cin>>n;
    int arr[n];
    printf("Enter Element:\n");
    for (int i=0;i<n;i++){
        cin>>arr[i];
    }
    quicksort(arr,0,n-1);
   for (int i=0;i<n;i++){
        cout<<arr[i]<<"\t";
    }
    return 0;
}