-
Notifications
You must be signed in to change notification settings - Fork 16
/
merge_sort.c
62 lines (51 loc) · 1.37 KB
/
merge_sort.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
#include <stdint.h>
#define MAX_SIZE 32
struct In {uint16_t input[MAX_SIZE];};
struct Out {uint16_t output[MAX_SIZE];};
void compute(struct In *input, struct Out *output){
int left, right, rend;
int i, j, k, m;
int interval;
for (interval = 1; interval < MAX_SIZE; interval *= 2 ) {
for (left = 0; left + interval < MAX_SIZE; left += interval * 2 ) {
right = left + interval;
rend = right + interval;
if (rend > MAX_SIZE) rend = MAX_SIZE;
m = left; i = left; j = right;
for (k = 0; k < 2 * interval; k++) {
if (i < right && j < rend) {
uint16_t x = input->input[i];
uint16_t y = input->input[j];
uint16_t smaller;
if (x < y) {
smaller = x;
i++;
} else {
smaller = y;
j++;
}
output->output[k + left] = smaller;
m++;
}
}
for (k = left; k < right; k++) {
if (i < right) {
output->output[m] = input->input[i];
i++; m++;
}
}
for (k = right; k < rend; k++) {
if (j < rend) {
output->output[m] = input->input[j];
j++; m++;
}
}
for (k = left; k < rend; k++) {
input->input[k] = output->output[k];
}
}
}
for (i = 0; i < MAX_SIZE; i++) {
output->output[i] = input->input[i];
}
}