-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlab4.cpp
121 lines (110 loc) · 2.53 KB
/
lab4.cpp
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
#include <iostream>
#include <ctime>
#include <vector>
void rand_ins(std::vector<int>& a) {
a.clear();
for (int i = 0; i < 30; ++i) {
a.push_back(std::rand() % 201 - 100);
std::cout << a[i] << " ";
}
std::cout << std::endl;
}
void show_a(std::vector<int>& a) {
for (int i : a) {
std::cout << i << " ";
}
std::cout << std::endl;
}
void cocktail(std::vector<int>& arr, int n) {
bool f = 1;
int strt = 0;
int end = n - 1;
while (f) {
for (int i = strt; i < end; ++i) {
if (arr[i] > arr[i + 1]) {
int k = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = k;
f = 1;
}
}
if (!f) break;
f = 0;
end--;
for (int i = end - 1; i >= strt; --i) {
if (arr[i] > arr[i + 1]) {
int k = arr[i];
arr[i] = arr[i + 1];
arr[i + 1] = k;
f = 1;
}
}
strt++;
}
}
void merge_o(std::vector<int>& arr, int, int, int);
void merge_s(std::vector<int>& arr, int l, int h) {
int mid;
if (l < h) {
mid = (l + h) / 2;
merge_s(arr, l, mid);
merge_s(arr, mid + 1, h);
merge_o(arr, l, h, mid);
}
}
void merge_o(std::vector<int>& arr, int l, int h, int mid) {
int i, j, k;
int* c = new int[arr.size()];
i = l;
k = i;
j = mid + 1;
while ((i <= mid) && (j <= h)) {
if (arr[i] < arr[j]) {
c[k] = arr[i];
++k; ++i;
}
else {
c[k] = arr[j];
++k; ++j;
}
}
while (i <= mid) {
c[k] = arr[i];
k++;
i++;
}
while (j <= h) {
c[k] = arr[j];
k++;
j++;
}
for (int y = l; y < k; ++y) arr[y] = c[y];
delete c;
}
void shell(std::vector<int>& arr, int n) {
for (int gap = n / 2; gap > 0; gap /= 2) {
for (int i = gap; i < n; ++i) {
int tmp = arr[i];
int j;
for (j = i; (j >= gap) && (arr[j - gap] > tmp); j -= gap) arr[j] = arr[j - gap];
arr[j] = tmp;
}
}
}
int main()
{
std::vector<int> a;
std::srand(std::time(nullptr));
rand_ins(a);
cocktail(a, a.size());
show_a(a);
rand_ins(a);
merge_s(a, 0, a.size() - 1);
show_a(a);
rand_ins(a);
shell(a, a.size());
show_a(a);
std::cout << std::endl;
return 0;
}