-
Notifications
You must be signed in to change notification settings - Fork 113
/
24.pointer-arrays-without-alloc.c
107 lines (85 loc) · 1.79 KB
/
24.pointer-arrays-without-alloc.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
#include <stdio.h>
#include <string.h>
#include <time.h>
#define MAXLINES 50000
#define ARR_SIZE 1000000
char strstore[ARR_SIZE];
char *lineptr[MAXLINES];
int readlines(char *lineptr[], int nlines);
void writelines(char *lineptr[], int nlines);
void qsort(char *lineptr[], int left, int right);
int main()
{
int nlines;
if ((nlines = readlines(lineptr, MAXLINES)) >= 0) {
qsort(lineptr, 0, nlines-1);
//writelines(lineptr, nlines);
return 0;
} else {
printf("error: input too big to sort\n");
return 1;
}
return 0;
}
#define MAXLEN 1000
int mygetline(char *, int);
char *alloc(int);
int readlines(char *lineptr[], int maxlines)
{
clock_t start, finish;
start = clock();
int len, nlines;
int offset = 0;
char *p, line[MAXLEN];
nlines = 0;
while ((len = mygetline(line, MAXLEN)) > 0)
if (nlines >= maxlines || (p = &strstore[offset]) == NULL)
return -1;
else {
line[len-1] = '\0';
strcpy(p, line);
offset += len;
lineptr[nlines++] = p;
}
finish = clock();
printf("without alloc: %f\n", ((double)(finish - start)) / CLOCKS_PER_SEC);
return nlines;
}
void writelines(char *lineptr[], int nlines)
{
while (nlines-- > 0)
printf("%s\n", *lineptr++);
}
int mygetline(char *s, int lim)
{
int c;
char *t = s;
while (--lim > 0 && (c = getchar()) != EOF && c != '\n')
*t++ = c;
if (c == '\n')
*t++ = c;
*t = '\0';
return t - s;
}
void qsort(char *v[], int left, int right)
{
int i, last;
void swap(char *v[], int i, int j);
if (left >= right)
return;
swap(v, left, (left + right)/2);
last = left;
for (i = left+1; i <= right; i++)
if (strcmp(v[i], v[left]) < 0)
swap(v, ++last, i);
swap(v, left, last);
qsort(v, left, last-1);
qsort(v, last+1, right);
}
void swap(char *v[], int i, int j)
{
char *temp;
temp = v[i];
v[i] = v[j];
v[j] = temp;
}