Algorithm-Data-Structure/GHI/prob12/main.c at master · FUN-Programming/Algorithm-Data-Structure · 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
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define swap(type, x, y) do {type t; t = x; x = y; y = t;} while(0)

typedef struct {
    int no;
    char name[20];
} Member;

int AscendingMemberNoCmp(const Member *x, const Member *y) {
    return x->no < y->no ? -1 : x->no > y->no ? 1 : 0;
}

int DescendingMemberNoCmp(const Member *x, const Member *y) {
    return x->no < y->no ? 1 : x->no > y->no ? -1 : 0;
}

int AscendingMemberNameCmp(const Member *x, const Member *y) {
    return strcmp(x->name, y->name);
}

int DescendingMemberNameCmp(const Member *x, const Member *y) {
    return strcmp(y->name, x->name);
}

void PrintLnMember(const Member *x) {
    printf("%d %s\n", x->no, x->name);
}

void Print(const Member *data, int n) {
    int i;

    for (i = 0; i < n; i++) {
        PrintLnMember(data + i);
    }
}

int counter = 0;
int quickCounter = 0;

void quick(Member *a, int left, int right, int compare(const Member *y, const Member *z)) {
    int pl = left;
    int pr = right;
    Member x = a[(pl + pr) / 2];
    quickCounter++;

    do {
        while (compare(&x, a + pl) > 0) pl++;
        while (compare(a + pr, &x) > 0) pr--;
        if (pl <= pr) {
            swap(Member, a[pl], a[pr]); counter++;
            pl++;
            pr--;
        }
    } while (pl <= pr);
    // ------------------------------------- 1
    if (quickCounter == 1) printf("pl: %d, pr: %d, left: %d, right: %d\n", pl, pr, left, right);
    if (left < pr) quick(a, left, pr, compare);
    if (pl < right) quick(a, pl, right, compare);
}

typedef enum {
    TERMINATE, ASCEND_NO, ASCEND_NAME,
    DESCEND_NO, DESCEND_NAME, PRINT_ALL
} Menu;

Menu SelectMenu(void) {
    int i, ch;
    char *mstring[] = {
            "Sort Ascend No", "Sort Ascend Name",
            "Sort Descend No", "Sort Descend Name",
            "Print All"
    };

    do {
        for (i = TERMINATE; i < PRINT_ALL; i++) {
            printf("(%2d) %-18.18s  ", i + 1, mstring[i]);
            if ((i % 3) == 2)
                putchar('\n');
        }
        printf("( 0) End : ");
        scanf("%d", &ch);
    } while (ch < TERMINATE || ch > PRINT_ALL);

    return (Menu) ch;
}

int main(void) {
    Menu menu;
    Member data[] = {
            {1, "takashi"},
            {3, "kouji"},
            {5, "umeda"},
            {7, "satoshi"},
            {6, "noyuri"},
            {2, "daisuke"},
            {0, "motoko"},
            {4, "agemi"},
            {9, "ito"},
            {2, "ohta"}
    };

    int ndata = sizeof(data) / sizeof(data[0]);

    do {
        switch (menu = SelectMenu()) {
            case ASCEND_NO:
                counter = quickCounter = 0;
                quick(data, 0, ndata-1, AscendingMemberNoCmp);
                printf("counter: %d, quick: %d\n", counter, quickCounter);
                break;
            case ASCEND_NAME:
                quick(data, 0, ndata-1, AscendingMemberNameCmp);
                break;
            case DESCEND_NO:
                quick(data, 0, ndata-1, DescendingMemberNoCmp);
                break;
            case DESCEND_NAME:
                counter = quickCounter = 0;
                quick(data, 0, ndata-1, DescendingMemberNameCmp);
                printf("counter: %d, quick: %d\n", counter, quickCounter);
                break;
            case PRINT_ALL:
                Print(data, ndata);
                break;
            default:
                break;
        }
    } while (menu != TERMINATE);

    return 0;
}