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
|
#include<iostream>
using namespace std;
void input(int *a, int n)
{
for (int i = 0; i < n; i++)
{
cout << "a[" << i << "]= ";
cin >> a[i];
}
}
void output(int *a, int n)
{
for (int i = 0; i < n; i++)
{
cout << a[i] << " ";
}
}
int QuickSort(int *a, int left, int right)
{
int oldright = right;
int pivot = left;
while (left < right)
{
while (a[right] >= a[pivot])
{
right = right - 1;
}
if (a[right] < a[pivot] && right > pivot)
{
swap(a[right], a[pivot]);
pivot = right;
}
while (a[left] <= a[pivot])
{
left = left + 1;
}
if (a[left] > a[pivot] && left < pivot)
{
swap(a[left], a[pivot]);
pivot = left;
}
}
QuickSort(a, 0, pivot - 1);
QuickSort(a, pivot + 1, oldright);
return 0;
}
int main()
{
int n;
cout << "Enter The Length of Array: "; cin >> n;
int *a = new int[n];
input(a, n);
QuickSort(a, 0, n - 1);
output(a, n);
return 0;
}
|
