forked from krish-ag/HacktoberFest22-Repo-DSA
-
Notifications
You must be signed in to change notification settings - Fork 0
/
cppQuickSort.cpp
61 lines (51 loc) · 1.3 KB
/
cppQuickSort.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
#include <bits/stdc++.h>
using namespace std;
void quickSort(int nums[],
int low, int high);
// Driver code
int main()
{
int nums[] = {1, 6, 3, 10, 50};
int size_nums = (sizeof(nums) /
sizeof(nums[0]));
cout << "Before sorting array is: \n";
for (int i = 0; i < size_nums; i++)
cout << nums[i] << " ";
cout << "\n\n";
quickSort(nums, 0, size_nums - 1);
cout << "After sorting array is: \n";
for (int i = 0; i < size_nums; i++)
cout << nums[i] << " ";
cout << "\n";
return 0;
}
void quickSort(int nums[],
int low, int high)
{
// Base Condition
if (low >= high)
return;
// These are just for swapping
// the elements.
int start = low, end = high;
int mid = start + ((end - start) / 2);
int pivot = nums[mid];
while (start <= end) {
while (nums[start] < nums[end])
start++;
while (nums[end] > pivot)
end--;
if (start <= end)
{
// Swapping the start and end
// elements.
int x = nums[start];
nums[start] = nums[end];
nums[end] = x;
start++;
end--;
}
}
quickSort(nums, low, end);
quickSort(nums, start, high);
}