backup/C-Plus-Plus
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/C-Plus-Plus.git synced 2026-04-04 02:59:43 +08:00
Code Issues Projects Releases Wiki Activity

modified comment block

Browse Source
This commit is contained in:
Ayaan Khan
2020-05-27 18:48:22 +05:30
parent c1764bd197
commit 50d6a14b2a
1 changed files with 14 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

23
sorting/quick_sort.cpp
View File

@@ -26,11 +26,14 @@
#include <cstdlib>
#include <iostream>
/* 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 */
/**
* 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(int arr[], int low, int high) {
int pivot = arr[high]; // taking the last element as pivot
@@ -52,10 +55,12 @@ int partition(int arr[], int low, int high) {
return (i + 1);
}
/* The main function that implements QuickSort
arr[] --> Array to be sorted,
low --> Starting index,
high --> Ending index */
/**
* The main function that implements QuickSort
* arr[] --> Array to be sorted,
* low --> Starting index,
* high --> Ending index
*/
void quickSort(int arr[], int low, int high) {
if (low < high) {
int p = partition(arr, low, high);