forked from AleexHrB/TGA-FIB
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSeq_sort.c
112 lines (75 loc) · 2.03 KB
/
Seq_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
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
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
#include <sys/times.h>
#include <sys/resource.h>
float GetTime(void) {
struct timeval tim;
struct rusage ru;
getrusage(RUSAGE_SELF, &ru);
tim=ru.ru_utime;
return ((double)tim.tv_sec + (double)tim.tv_usec / 1000000.0)*1000.0;
}
void insertion(int* v, int a, int b) {
int lim_inf = a;
int i = lim_inf;
int lim_sup = b+1;
//Insertion Sort a bloques de size_i de tamaño
while (i < lim_sup) {
int x = v[i];
int j = i - 1;
while (j >= lim_inf && v[j] > x) {
v[j+1] = v[j];
--j;
}
v[j+1] = x;
++i;
}
}
void merge(int *v, int *aux, int a, int mid, int b) {
int i = a;
int j = mid + 1;
int idx = i;
while (i <= mid && j <= b) {
if (v[i] <= v[j]) aux[idx++] = v[i++];
else aux[idx++] = v[j++];
}
while (i <= mid) aux[idx++] = v[i++];
while (j <= b) aux[idx++] = v[j++];
for (int k = a; k <= b; ++k) v[k] = aux[k];
}
void multisort(int *v, int* aux, int i, int j, unsigned int size_i) {
if (j-i+1 == size_i) insertion(v, i, j);
else {
int mid = i + (j-i)/2;
multisort(v, aux, i, mid, size_i);
multisort(v, aux, mid+1, j, size_i);
merge(v, aux, i, mid, j);
}
}
int main(int argc, char** argv) {
if (argc != 4) {
printf("Número de parámetros no válido\n");
return -1;
}
int n = 1 << atoi(argv[1]);
unsigned int size_i = 1 << atoi(argv[2]);
int *v = (int *)malloc(n*sizeof(int));
int *aux = (int *)malloc(n*sizeof(int));
srand(21364);
const unsigned int sorted_mode = 0;
const unsigned int random_mode = 1;
const unsigned int sorted_back_mode = 2;
const unsigned int mode = atoi(argv[3]);
if (mode == random_mode) for (unsigned int i = 0; i < n; ++i) v[i] = rand();
else if (mode == sorted_mode) for (unsigned int i = 0; i < n; ++i) v[i] = i;
else for (unsigned int i = 0; i < n; ++i) v[i] = n - i;
float t1, t2;
t1 = GetTime();
multisort(v, aux, 0, n-1, size_i);
t2 = GetTime();
printf("n: 2^%s, size_i: %d\n", argv[1], size_i);
printf("Elapsed Sequential Time: %f \n", t2 - t1);
free(v);
free(aux);
}