QuickSort is a Divide and Conquer algorithm. It picks an element as pivot and partitions the given array around the picked pivot.

QuickSort.cpp

#include <iostream>
using namespace std;

int getPartitionPoint(int* arrData, int low, int high){
//Set pivot	
 int pivot = arrData[(low+high)/2];
 
 while(low < high){
	 //Move pointer for left half
 	while(arrData[low] < pivot){
 		low++;
	 }
	 //Move pointer for right half
	 while(arrData[high] > pivot){
	 	high--;
	 }
	 //Edge case
	 if (arrData[low] == arrData[high]){
	 	low++;
	 }else{
		 //Swap if out of order
	 	if(low < high){
	 		int temp = arrData[low];
	 		arrData[low] = arrData[high];
	 		arrData[high]= temp;
		 }
	 }
	 
 }
// Return partition point
return high;
}

void quickSort(int* arrData,int low ,int high){
	if(low < high){
		//Partition array 
		int partitionIndex = getPartitionPoint(arrData,low,high);
		//Sort left half
		quickSort(arrData,low,partitionIndex-1);
		//Sort right half
		quickSort(arrData,partitionIndex+1,high);
	}
}

int main(){
 int arrData[] = {
 1231,12,2233,32323,23};
 int size = sizeof(arrData)/sizeof(arrData[0]);
 quickSort(arrData,0,size-1);
 for(int i = 0;i< size;i++){
 	
 	cout<<" "<<arrData[i];
 }
 return 0;
}