Repository navigation
Expand file tree
/
Copy pathQuickSort.cpp
More file actions
91 lines (71 loc) 路 1.8 KB
/
Copy pathQuickSort.cpp
File metadata and controls
91 lines (71 loc) 路 1.8 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
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#pragma region LICENSE
// Copyright 2019 PaleCosmos
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
#pragma endregion
#include "../Data.h"
int partition(int *, int, int);
void conqurer(int *, int, int);
void quickSort(int *arr)
{
conqurer(arr, 0, size - 1);
}
int main()
{
clock_t start, end;
int *arr = arrData;
print(arr, "Before");
start = clock();
quickSort(arr);
end = clock();
print(arr, "\nAfter");
timeStamp(start, end); // 1ms
return 0;
}
int partition(int *arr, int left, int right)
{
int temp;
int low = left;
int high = right + 1;
int pivot = arr[left];
do
{
do
{
low++;
} while (low <= right && arr[low] < pivot);
do
{
high--;
} while (high >= left && arr[high] > pivot);
if (low < high)
{
temp = arr[low];
arr[low] = arr[high];
arr[high] = temp;
}
} while (low < high);
temp = arr[left];
arr[left] = arr[high];
arr[high] = temp;
return high;
}
void conqurer(int *arr, int left, int right)
{
if (left < right)
{
int pivot = partition(arr, left, right);
conqurer(arr, left, pivot - 1);
conqurer(arr, pivot + 1, right);
}
}