aboutsummaryrefslogtreecommitdiffstats
path: root/test/mppa/sort/insertion.c
blob: bca095990bce1f813d37905acc624ca1a3dbca28 (plain)
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
#include "../prng/prng.h"
#include "../prng/types.h"

#ifdef __UNIT_TEST_INSERTION__
#define SIZE 100
#else
#include "test.h"
#endif

void swap_ins(uint64_t *a, uint64_t *b){
    uint64_t tmp = *a;
    *a = *b;
    *b = tmp;
}

int insert_sort(uint64_t *res, const uint64_t *T){
    int i, j;

    if (SIZE <= 0)
        return -1;

    for (i = 0 ; i < SIZE ; i++)
        res[i] = T[i];

    for (i = 0 ; i < SIZE-1 ; i++){
        if (res[i] > res[i+1]){
            swap_ins(&res[i], &res[i+1]);
            for (j = i ; j > 0 ; j--)
                if (res[j-1] > res[j])
                    swap_ins(&res[j-1], &res[j]);
        }
    }

    return 0;
}

#ifdef __UNIT_TEST_INSERTION__
int main(void){
    uint64_t T[SIZE];
    uint64_t res[SIZE];
    int i;
    srand(42);

    for (i = 0 ; i < SIZE ; i++)
        T[i] = randlong();

    /* Sorting the table */
    if (insert_sort(res, T) < 0) return -1;

    /* Computing max(T) */
    uint64_t max = T[0];
    for (i = 1 ; i < SIZE ; i++)
        if (T[i] > max)
            max = T[i];

    /* We should have: max(T) == res[SIZE] */
    return !(max == res[SIZE-1]);
}
#endif // __UNIT_TEST_INSERTION__