-
Notifications
You must be signed in to change notification settings - Fork 229
Expand file tree
/
Copy pathStack_reduced_QuickSort.cpp
More file actions
69 lines (51 loc) · 1.28 KB
/
Copy pathStack_reduced_QuickSort.cpp
File metadata and controls
69 lines (51 loc) · 1.28 KB
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
62
63
64
65
66
67
68
69
#include <iostream>
#include <vector>
#include <stack>
using namespace std;
int partition(vector<int>& arr, int low, int high) {
int pivot = arr[high];
int i = low - 1;
for (int j = low; j < high; j++) {
if (arr[j] <= pivot) {
i++;
swap(arr[i], arr[j]);
}
}
swap(arr[i + 1], arr[high]);
return i + 1;
}
void quickSort(vector<int>& arr, int low, int high) {
stack<pair<int, int>> stk;
stk.push({low, high});
while (!stk.empty()) {
pair<int, int> current = stk.top();
stk.pop();
low = current.first;
high = current.second;
int pivotIndex = partition(arr, low, high);
if (pivotIndex - 1 > low) {
stk.push({low, pivotIndex - 1});
}
if (pivotIndex + 1 < high) {
stk.push({pivotIndex + 1, high});
}
}
}
int main() {
cout << "Quick Sort using Stack" << endl;
int n;
cout << "Enter the number of elements: ";
cin >> n;
vector<int> arr(n);
cout << "Enter the elements: ";
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
quickSort(arr, 0, n - 1);
cout << "Sorted Array: ";
for (int i = 0; i < n; i++) {
cout << arr[i] << " ";
}
cout << endl;
return 0;
}