Quick Sort - Implementation with C++

/* Bismillahir Rahmanir Rahim Implementation of Quick-Sort using C++ */ #include<bits/stdc++.h> using namespace std; int ar[1000]; int partition (int low, int high){ int pivot=ar[high]; int i=(low-1); for(int j=low; j<high; j++){ if(ar[j]<=pivot){ i++; swap(ar[i],ar[j]); } } swap(ar[i+1], ar[high]); return (i+1); } void quickSort(int low, int high){ if(low<high){ int pi=partition(low, high); quickSort(low, pi-1); quickSort(pi+1, high); } } int main(){ int n,i; cin>>n; for(i=0;i<n;i++) cin>>ar[i]; quickSort(0, n-1); for(i=0; i<n; i++) cout<<ar[i]<<" "; cout<<endl; return 0; }