-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathpancake.c
More file actions
64 lines (57 loc) · 1.11 KB
/
pancake.c
File metadata and controls
64 lines (57 loc) · 1.11 KB
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
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
void flip(int * list, int n) {
int i, tmp;
for (i=0; i<n/2; i++) {
tmp = list[i];
list[i] = list[n-i-1];
list[n-i-1] = tmp;
}
}
void dosort(int *, int);
int main(void) {
int i, n;
int list[5000];
char str[5000];
char * tmpstr;
FILE * f = fopen("test.txt", "r");
if (!f) {
printf("failed to open test.txt\n");
return 1;
}
while (fgets(str, 5000, f)) {
n = 0;
memset(list, 0, 5000);
tmpstr = strtok(str, " ");
while (tmpstr) {
list[n++] = atoi(tmpstr);
tmpstr = strtok(NULL, " ");
}
dosort(list, n);
printf("0\n");
}
}
void dosort(int * list, int n) {
int i, cnt=0;
int sort[5000] = {0};
int * sort_cur = sort;
for (int current=n-1; current>=0; current--) {
int max_idx = 0;
for (i=0; i<=current; i++)
if (list[i] > list[max_idx])
max_idx = i;
if (current != max_idx) {
if (max_idx != 0) {
flip(list, max_idx+1);
cnt++;
*(sort_cur++) = n-max_idx;
}
flip(list, current+1);
cnt++;
*(sort_cur++) = n-current;
}
}
for (sort_cur = sort; *sort_cur; sort_cur++)
printf("%d ", *sort_cur);
}