-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsort.cpp
More file actions
108 lines (98 loc) · 2.38 KB
/
Copy pathsort.cpp
File metadata and controls
108 lines (98 loc) · 2.38 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
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
//
// Created by 宋峰 on 2018/9/24.
//
#include <vector>
#include <iostream>
using namespace std;
int partition(int vec[], int begin, int end) {
int i = begin - 1;
int j = begin;
int x = vec[end];
while (j < end) {
if (vec[j] < x) {
i += 1;
int tmp = vec[i];
vec[i] = vec[j];
vec[j] = tmp;
}
j += 1;
}
int tmp = vec[i + 1];
vec[i + 1] = vec[end];
vec[end] = tmp;
return i + 1;
}
void qsort(int vec[], int begin, int end) {
if (begin >= end) {
return;
}
int k = partition(vec, begin, end);
qsort(vec, begin, k - 1);
qsort(vec, k + 1, end);
}
void adjustHeap(vector<int> &vec, int begin, int end) {
int top = begin;
int x = vec[top];
int left = top * 2 + 1;
int right = top * 2 + 2;
int max_index = top;
if (left <= end && vec[left] > x) {
max_index = left;
}
if (right <= end && vec[right] > vec[max_index]) {
max_index = right;
}
if (max_index != top) {
int tmp = vec[max_index];
vec[max_index] = vec[top];
vec[top] = tmp;
adjustHeap(vec, max_index, end);
}
}
void buildheap(vector<int> &vec, int begin, int end) {
for (int i = (end + begin) / 2; i >= begin; i--) {
adjustHeap(vec, i, end);
}
}
void heapsort(vector<int> &vec, int begin, int end) {
buildheap(vec, begin, end);
for (int i = end; i >= begin; i--) {
adjustHeap(vec, begin, i);
int tmp = vec[begin];
vec[begin] = vec[i];
vec[i] = tmp;
}
}
void adjust(vector<int> &vec, int begin, int end) {
int top = begin;
int left = 2 * begin + 1;
int right = 2 * begin + 2;
if (left <end && vec[left] > vec[top]) {
top = left;
}
if (right < end && vec[right] > vec[top]) {
top = right;
}
if (top == begin) {
return;
} else {
int tmp =vec[begin];
vec[begin]=vec[top];
vec[top]=tmp;
adjust(vec, top, end);
}
}
void buidheap1(vector<int> &vec, int begin, int end) {
for (int i = (begin + end) / 2; i >= begin; i--) {
adjust(vec, i, end);
}
}
void heapsort1(vector<int> &vec, int begin, int end){
buidheap1(vec,begin,end);
for(int i=end-1;i>=begin;i--){
int tmp = vec[begin];
vec[begin] = vec[i];
vec[i]=tmp;
adjust(vec,begin,i);
}
}