-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSource.c
125 lines (90 loc) · 1.49 KB
/
Source.c
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
#include "Header.h"
void PrintMas(double* a, int l)
{
int i = 0;
for (i = 0; i < l; i++)
{
printf("%d) %lf\n", i+1, a[i]);
}
}
void Puzirec(double* a, int l)
{
int i, j;
double tmp = 0;
for (i = 0; i < l; i++)
{
for (j = 0; j < l - i - 1; j++)
{
if (a[j] > a[j + 1])
{
tmp = a[j];
a[j] = a[j + 1];
a[j + 1] = tmp;
}
}
}
}
/*void Vstavki(double* a, int l)
{
int i, j;
double tmp = 0;
for (i = 1; i < l; i++)
{
tmp = a[i];
for (j = i - 1; j > 0; j--)
{
if (a[j] > tmp)
{
a[j + 1] = a[j];
}
else
break;
}
a[j + 1] = tmp;
}
}
*/
void qSort(double* mas, int l)
{
int i = 0;
int j = l - 1;
double tmp = 0;
double x = mas[(int)(l / 2)];
do
{
while (mas[i] < x) i++;
while (mas[j] > x) j--;
if (i <= j)
{
tmp = mas[i];
mas[i] = mas[j];
mas[j] = tmp;
i++;
j--;
}
} while (i <= j);
if (j > 0)
qSort(mas, j + 1);
if (i < l)
qSort(&mas[i], l - i);
}
/*void Bistra(double* a, int l)
{
qSort(a, 0, l - 1);
}*/
void Vstavki(double* mas, int l )
{
int i, j;
double tmp = 0.0;
for (i = 1; i < l; i++)
{
tmp = mas[i];
j = i - 1;
while((j >= 0) && (mas[j] > tmp))
{
mas[j+1] = mas[j];
j--;
}
mas[j+1] = tmp;
}
}