-
Notifications
You must be signed in to change notification settings - Fork 0
/
sort.h
136 lines (118 loc) · 2.14 KB
/
sort.h
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
133
134
135
void selectionSort(
int vector[],
int vector_length
){
int min, temp;
for(int i = 0; i < vector_length - 1; i++){
min = i;
for(int j = i+1; j < vector_length; j++){
if(vector[j] < vector[min]){
min = j;
}
}
temp = vector[i];
vector[i] = vector[min];
vector[min] = temp;
}
}
void insertionSort(
int vector[],
int vector_length
){
for (int i = 1; i < vector_length; i++) {
int floor = vector[i];
int j = i - 1;
while (j >= 0 && floor < vector[j]) {
vector[j + 1] = vector[j];
--j;
}
vector[j + 1] = floor;
}
}
void merge(
int vector[],
int start,
int middle,
int end
){
int i, j, k, left_length, right_length;
left_length = middle - start + 1;
right_length = end - middle;
int left_side[left_length + 1], right_side[right_length + 1];
for(i = 0; i < left_length; i++){
left_side[i] = vector[start + i];
}
left_side[i] = 1000000;
for(i = 0; i < right_length; i++){
right_side[i] = vector[middle + i + 1];
}
right_side[i] = 1000000;
i = 0, k = 0, j = 0;
for(k = start; k < end + 1; k++){
if(left_side[i] <= right_side[j]){
vector[k] = left_side[i];
i++;
} else{
vector[k] = right_side[j];
j++;
}
}
}
void mergesort(
int vector[],
int start,
int end
){
int meio;
if(start < end){
meio = (start + end) / 2;
mergesort(vector, start, meio);
mergesort(vector, meio+1, end);
merge(vector, start, meio, end);
}
}
int partition(
int vector[],
int start,
int end
){
int pivot, j, i, temp;
pivot = vector[end];
i = start-1;
for(j = start; j < end; j++){
if(vector[j] <= pivot){
i++;
temp = vector[i];
vector[i] = vector[j];
vector[j] = temp;
}
}
temp = vector[i+1];
vector[i+1] = vector[end];
vector[end] = temp;
return i+1;
}
void quicksort(
int vector[],
int start,
int end
){
int position = 0;
if (start < end){
position = partition(
vector,
start,
end
);
quicksort(
vector,
start,
position - 1
);
quicksort(
vector,
position + 1,
end
);
}
}