Scribd
Upload
120 views

C++ QuickSort

This C++ program implements quicksort to sort an array of integers. It defines functions to print an array, swap two elements, and perform a quicksort partition and recursion. The main function initializes an unsorted array, calls quicksort to sort it, and prints the sorted array.

Uploaded by

Taimoor Ul Hassan
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
120 views

C++ QuickSort

This C++ program implements quicksort to sort an array of integers. It defines functions to print an array, swap two elements, and perform a quicksort partition and recursion. The main function initializes an unsorted array, calls quicksort to sort it, and prints the sorted array.

Uploaded by

Taimoor Ul Hassan
Copyright
© © All Rights Reserved
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 1

#include <iostream>

using namespace std;

void print(int *a, int n)


{
int i=0;
while(i<n){
cout<<a[i]<<",";
i++;
}
}

void swap(int i,int j, int *a){


int temp = a[i];
a[i] = a[j];
a[j] = temp;
}

void quicksort(int *arr, int left, int right){


int min = (left+right)/2;
cout<<"QS:"<<left<<","<<right<<"\n";

int i = left;
int j = right;
int pivot = arr[min];

while(left<j || i<right)
{
while(arr[i]<pivot)
i++;
while(arr[j]>pivot)
j--;

if(i<=j){
swap(i,j,arr);
i++;
j--;
}
else{
if(left<j)
quicksort(arr, left, j);
if(i<right)
quicksort(arr,i,right);
return;
}
}
}

int main() {
int arr[8] = {110, 5, 10,3 ,22, 100, 1, 23};
quicksort(arr, 0, (sizeof(arr)/sizeof(arr[0]))-1);
print(arr, (sizeof(arr)/sizeof(arr[0])));
return 0;
}

You might also like