-
Notifications
You must be signed in to change notification settings - Fork 0
/
归并排序.txt
63 lines (63 loc) · 1.02 KB
/
归并排序.txt
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
#include<iostream>
#include<vector>
#include<sstream>
#include "sort.h"
using namespace std;
void merge(vector<int>& numvec, int start, int mid, int end)
{
vector<int> tmp;
int i = start, j = mid + 1;
while (i <= mid && j <= end)
{
if (numvec[i] <= numvec[j]) {
tmp.push_back(numvec[i]);
i++;
}
else {
tmp.push_back(numvec[j]);
j++;
}
}
while (i <= mid) {
tmp.push_back(numvec[i]);
i++;
}
while (j <= end)
{
tmp.push_back(numvec[j]);
j++;
}
for (int p = 0; p < tmp.size(); p++)
{
numvec[start + p] = tmp[p];
}
}
void merge_sort(vector<int>& numvec, int start, int end)
{
if (start < end)
{
int mid = (start + end) / 2;
merge_sort(numvec, start, mid);
merge_sort(numvec, mid + 1, end);
merge(numvec, start, mid, end);
}
}
int main()
{
stringstream ss;
string str;
int temp;
vector<int> data;
getline(cin, str);
ss << str;
while (ss >> temp)
{
data.push_back(temp);
}
merge_sort(data, 0, (int)data.size() - 1);
for (auto ele : data)
{
cout << ele << " ";
}
cout << endl;
}