-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsort.cpp
More file actions
executable file
·132 lines (98 loc) · 1.98 KB
/
sort.cpp
File metadata and controls
executable file
·132 lines (98 loc) · 1.98 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
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
#include <iostream>
#include <vector>
#include <algorithm>
#include <time.h>
#include <windows.h>
using namespace std;
void print(int nElem)
{
cout << nElem << " ";
}
int Partition(vector<int> &vc, int nLow, int nHigh)
{
int nTmp;
nTmp = vc[nLow];
while (nLow < nHigh)
{
while (nLow < nHigh && vc[nHigh] >= nTmp) --nHigh;
vc[nLow] = vc[nHigh];
while (nLow < nHigh && vc[nLow] <= nTmp) ++nLow;
vc[nHigh] = vc[nLow];
}
vc[nLow] = nTmp;
return nLow;
}
void QuickSort(vector<int> &vc, int nLow, int nHigh)
{
int nMid;
if (nLow < nHigh)
{
nMid = Partition(vc, nLow, nHigh);
QuickSort(vc, nLow, nMid - 1);
QuickSort(vc, nMid + 1, nHigh);
}
}
void MaxHeapAdjust(vector<int> &vc, int nPos, int nSize)
{
int i;
int nTmp;
nTmp = vc[nPos];
for (i = nPos* 2; i < nSize; i *= 2)
{
if (i < nSize && vc[i] < vc[i + 1]) ++i;
if (vc[i] <= nTmp) break;
vc[nPos] = vc[i];
nPos = i;
}
vc[nPos] = nTmp;
}
void MakeMaxHeap(vector<int> &vc)
{
int i;
for (i = (vc.size()-1)/2; i > 0; --i)
{
MaxHeapAdjust(vc, i, vc.size()-1);
}
}
void SortMaxHeap(vector<int> &vc)
{
int i, nTmp;
MakeMaxHeap(vc);
for (i = vc.size() - 1; i > 0; --i)
{
nTmp = vc[1];
vc[1] = vc[i];
vc[i] = nTmp;
MaxHeapAdjust(vc, 1, i - 1);
}
}
void ShowTime()
{
SYSTEMTIME systime = {0};
GetLocalTime(&systime);
cout << "sec: " << systime.wSecond << "usec: " << systime.wMilliseconds <<endl;
}
/*
int main(int argc, char *argv[])
{
int i;
const int nMax = 10000000;
int nBeginTime, nEndTime;
vector<int> vc;
srand(time(NULL));
for (i = 0; i < nMax; ++i)
{
vc.push_back(rand()%nMax);
}
//for_each(vc.begin(), vc.end(), print);
//cout << endl;
ShowTime();
QuickSort(vc, 0, vc.size() - 1);
//SortMaxHeap(vc);
ShowTime();
//for_each(vc.begin(), vc.end(), print);
//cout << endl;
cout << "quicksort(" << nMax << ") time: " << endl;
return 0;
}
*/