Quick_sort

#include <iostream>
using namespace std;
int partition(int arr[],int s,int e)
{
  int cnt=0;
  int pivot=arr[s];
  for(int i=s+1;i<=e;i++)
    {
      if(arr[i]<=pivot)
      {
        cnt++;
      }
    }
  int pivotIndex=s+cnt;
  swap(arr[pivotIndex],arr[s]);
  int i=s,j=e;
  while(i<pivotIndex && j>pivotIndex)
    {
      while(arr[i]<=pivot)
      {
        i++;
      }
      while(arr[j]>pivot)
        {
          j--;
        }
      if(i<pivotIndex && j>pivotIndex)
      {
        swap(arr[i++],arr[j--]);
      }
    }
  return pivotIndex;
}
void quickSort(int arr[],int s,int e)
{
  if(s>=e)
  {
    return;
  }
  int p=partition(arr,s,e);
  //sort left part
  quickSort(arr,s,p-1);
  //sort right part
  quickSort(arr,p+1,e);
  
}
int main() {
  int arr[17] = {5, 4, 3, 2, 1,34,46,56,2,3,4,5,7,8,9,7,4};
  int n = 17;
  quickSort(arr, 0, n - 1);
  for (int i = 0; i < n; i++) {
    cout << arr[i] << " ";
  }
  cout << endl;
}