Created
November 16, 2020 11:07
-
-
Save apshada/d227b2c4224e1ab4333a2d76837e8788 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <bits/stdc++.h> | |
using namespace std; | |
/* This function takes last element as pivot, places | |
the pivot element at its correct position in sorted | |
array, and places all smaller (smaller than pivot) | |
to left of pivot and all greater elements to right | |
of pivot */ | |
int partition (vector<int> &arr, int low, int high) | |
{ | |
int pivot = arr[high]; // pivot | |
int i = (low - 1); // Index of smaller element | |
for (int j = low; j <= high - 1; j++) | |
{ | |
// If current element is smaller than the pivot | |
if (arr[j] < pivot) | |
{ | |
i++; // increment index of smaller element | |
swap(arr[i], arr[j]); | |
} | |
} | |
swap(arr[i + 1], arr[high]); | |
return (i + 1); | |
} | |
/* The main function that implements QuickSort | |
arr[] --> Array to be sorted, | |
low --> Starting index, | |
high --> Ending index */ | |
void quickSort(vector<int> &arr, int low, int high) | |
{ | |
if (low < high) | |
{ | |
/* pi is partitioning index, arr[p] is now | |
at right place */ | |
int pi = partition(arr, low, high); | |
// Separately sort elements before | |
// partition and after partition | |
quickSort(arr, low, pi - 1); | |
quickSort(arr, pi + 1, high); | |
} | |
} | |
/* Function to print an array */ | |
void printArray(vector<int> arr, int size) | |
{ | |
int i; | |
for (i = 0; i < size; i++) | |
cout << arr[i] << " "; | |
cout << endl; | |
} | |
int main() | |
{ | |
int n; | |
cout<<"Enter No. of Elements -: "; | |
cin>>n; | |
vector<int> arr(n,0); | |
cout<<"Enter Data -: "; | |
for(int i=0;i<n;i++){ | |
cin>>arr[i]; | |
} | |
quickSort(arr, 0, n - 1); | |
cout << "Sorted array: \n"; | |
printArray(arr, n); | |
return 0; | |
} | |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment