clang/pointers-to-function-test.c at master · liboshi/clang · GitHub

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
#include <stdio.h>
#include <stdlib.h>
#include <errno.h>
#include <string.h>

typedef int (*somefunc)(int, int);

int
product(int a, int b)
{
        printf("Sum is: %d\n", a + b);
        return a + b;
}

void
die(const char *message)
{
        if (errno) {
                perror(message);
        } else {
                printf("ERROR: %s\n", message);
        }
}

typedef int (*compare_cb)(int, int);

int *
bubble_sort(int *numbers, int count, compare_cb cmp)
{
        int temp = 0;
        int i = 0;
        int j = 0;
        int *target = malloc(count * sizeof(int));

        if (!target) die("Memory error.");

        memcpy(target, numbers, count * sizeof(int));

        for (i = 0; i < count; i++) {
                for (j = 0; j < count - 1; j++) {
                        if(cmp(target[j], target[j + 1]) > 0) {
                                temp = target[j + 1];
                                target[j + 1] = target[j];
                                target[j] = temp;
                        }
                }
        }
        return target;
}

int
sorted_order(int a, int b)
{
        return a - b;
}

int
reverse_order(int a, int b)
{
        return b - a;
}

int
strange_order(int a, int b)
{
        if (a == 0 || b == 0) {
                return 0;
        } else {
                return a % b;
        }
}

void
test_sorting(int *numbers, int count, compare_cb cmp)
{
        int i = 0;
        int *sorted = bubble_sort(numbers, count, cmp);
        if (!sorted) die("Failed to sort as requesed.");

        for (i = 0; i < count; i++) {
                printf("%d ", sorted[i]);
        }
        printf("\n");
        free(sorted);
}

int
main(int argc, char *argv[])
{
        if (argc < 2) die("USAGE: ex18 4 3 1 5 6");

        int count = argc - 1;
        int i = 0;
        char **inputs = argv + 1;

        int *numbers = malloc(count * sizeof(int));
        if (!numbers) die("Memory error.");

        for (i = 0; i < count; i++) {
                numbers[i] = atoi(inputs[i]);
        }

        test_sorting(numbers, count, sorted_order);
        test_sorting(numbers, count, reverse_order);
        test_sorting(numbers, count, strange_order);

        free(numbers);

    return 0;
}