forked from Arius1044/Mega_sorting
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAray.cpp
More file actions
115 lines (89 loc) · 2.03 KB
/
Copy pathAray.cpp
File metadata and controls
115 lines (89 loc) · 2.03 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
#include <iostream>
#include <time.h>
#include "Array.h"
using namespace std;
void Array::Quiq_sort(long long int begin, long long int end)
{
long long int left = begin, right = end, m = Arr[int((right + left) / 2)];
while (left <= right)
{
while (Arr[left] < m) left++;
while (Arr[right] > m) right--;
if (left <= right) swap(Arr[left++], Arr[right--]);
}
if (left < end) Quiq_sort( left, end);
if (right > begin) Quiq_sort( begin, right);
}
void Array::Merge_sort(long long int begin, long long int end)
{
if (end <= begin)
return;
long long int ser = (begin + end) / 2;
Merge_sort( begin, ser);
Merge_sort( ser + 1, end);
long long int *new_a = new long long int[100000];
for (long long k = begin; k <= end; k++)
new_a[k] = Arr[k];
long long i = begin, j = ser + 1;
for (long long k = begin; k <= end; k++) {
if (i > ser) {
Arr[k] = new_a[j];
j++;
}
else if (j > end) {
Arr[k] = new_a[i];
i++;
}
else if (new_a[j] < new_a[i]) {
Arr[k] = new_a[j];
j++;
}
else {
Arr[k] = new_a[i];
i++;
}
}
delete[] new_a;
}
void Heapily(long long int *Arr, long long int father, long long int size)
{
if (2 * father + 1 < size)
{
long long int son = 2 * father + 1; //ïåðøèé ñèí
if (2 * father + 2 < size && Arr[2 * father + 2] >= Arr[son]) // äðóãèé ñèí, ÿêùî ³ñíóº ³ á³ëüøèé çà ïåðøîãî
{
son = 2 * father + 2;
}
if (Arr[father] < Arr[son]) //íàéá³ëüøèé ñèí³â á³ëüøèé çà áàòüêà
{
swap(Arr[father], Arr[son]);
}
return Heapily(Arr, son, size); //ïðåäîê íàñòóïíèé åëåìåíò
}
}
void Array::Heap_sort()
{
long long int i;
for (i = size - 1; i >= 0; --i)
Heapily(Arr, i, size);
for (i = size - 1; i >= 0; --i)
{
swap(Arr[0], Arr[i]);
Heapily(Arr, 0, i);
}
}
Array::Array(long long int _size_)
{
size = _size_;
Arr = new long long int[size];
srand(time(NULL));
for (int i = 0; i < size; Arr[i++] = rand() % 1000000 - 20000);
}
Array::~Array()
{
delete[] Arr;
}
void Array::Print() const
{
for (int i = 0; i < size; cout << Arr[i] << " ", ++i); cout << "\n\n";
}