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
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
/* The C Programming Language: 2nd Edition
*
* Exercise 5-15: Add the option -f to fold upper and lower case together, so
* that case distinctions are not made during sorting; for example, a and A
* compare equal.
*/
#define MAXLINES 5000
char *lineptr[MAXLINES];
#define MAXLEN 1000
#define DEFAULT_LINES 10
#define ALLOCSIZE 10000000
static char allocbuf[ALLOCSIZE];
static char *allocp = allocbuf;
char *alloc(int);
int readlines(char *lineptr[], int nlines);
void writelines(char *lineptr[], int nlines);
void reverse_set(char *lineptr[], int nlines);
void my_qsort(void *lineptr[], int left, int right, int (*comp)(const char *, const char *));
int numcmp(const char *, const char *);
int istrcmp(const char *, const char *);
void my_qsort(void *v[], int left, int right, int (*comp)(const char *, const char *)) {
int i, last;
void swap(void *v[], int, int);
if (left >= right) {
return;
}
swap(v, left, (left + right) / 2);
last = left;
for (i = left + 1; i <= right; i++) {
if ((*comp)(v[i], v[left]) <= 0) {
swap(v, ++last, i);
}
}
swap(v, left, last);
my_qsort(v, left, last - 1, comp);
my_qsort(v, last + 1, right, comp);
}
int numcmp(const char *s1, const char *s2) {
double v1, v2;
v1 = atof(s1);
v2 = atof(s2);
if (v1 < v2) {
return -1;
} else if (v1 > v2) {
return 1;
} else {
return 0;
}
}
void swap(void *v[], int i, int j) {
void *temp;
temp = v[i];
v[i] = v[j];
v[j] = temp;
}
int readlines(char *lineptr[], int maxlines) {
int len, nlines;
char *p, line[MAXLEN];
nlines = 0;
while ((len = mygetline(line, MAXLEN)) > 0) {
if (nlines >= maxlines || (p = alloc(len)) == NULL) {
return -1;
} else {
line[len-1] = '\0';
strcpy(p, line);
lineptr[nlines++] = p;
}
}
return nlines;
}
void writelines(char *lineptr[], int nlines) {
int i = 0;
for (; i < nlines && lineptr[i] != NULL; i++) {
printf("%s\n", lineptr[i]);
}
}
void reverse_set(char *lineptr[], int nlines) {
int i;
int j = nlines;
for (i = 0; i < (nlines / 2); i++, j--) {
if (i < nlines) {
swap((void **)lineptr, i, j);
}
}
}
/* Ignore character case, then send results to qsort */
int istrcmp(const char *s1, const char *s2) {
for ( ; tolower(*s1) == tolower(*s2); s1++, s2++) {
if (*s1 == '\0') {
return 0;
}
}
return tolower(*s1) - tolower(*s2);
}
int mygetline(char *line, int lim) {
int c, i;
for (i = 0; i < lim && (c = getchar()) != EOF && c != '\n'; i++) {
*(line++) = c;
}
if (c == '\n') {
i++; /* I count newlines; some don't */
*(line++) = c;
}
*line = '\0';
return i;
}
char *alloc(int n) {
if (allocbuf + ALLOCSIZE - allocp >= n) {
allocp += n;
return allocp - n;
} else {
return 0;
}
}
/* sort input lines */
int main (int argc, char *argv[]) {
int nlines; /* number of input lines read */
int numeric = 0; /* 1 if numeric sort */
int reverse = 0; /* 1 if reverse sort */
int fold = 0; /* 1 if folding upper and lower case */
if (argc > 1) {
int i;
for (i = 1; --argc; i++) {
if (strcmp(argv[i], "-n") == 0) {
numeric = 1;
} else if (strcmp(argv[i], "-r") == 0) {
reverse = 1;
} else if (strcmp(argv[i], "-f") == 0) {
fold = 1;
}
}
}
if ((nlines = readlines(lineptr, MAXLINES)) >= 0) {
/* The trick is to chain inline if-statements. This will point to the correct
function for comparison, which powers my_qsort */
my_qsort((void **) lineptr, 0, nlines - 1, (int (*)(const char *, const char *))(numeric ? numcmp : (fold ? istrcmp : strcmp)));
if (reverse == 1) {
reverse_set(lineptr, nlines - 1);
}
writelines(lineptr, nlines);
return 0;
} else {
printf("Input too big to sort\n");
return 1;
}
}
|
