-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathpancakeSort.c
More file actions
102 lines (81 loc) · 2.13 KB
/
pancakeSort.c
File metadata and controls
102 lines (81 loc) · 2.13 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
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
#include <stdio.h>
#define length_of_array(array) sizeof(array) / sizeof(array[0])
#ifndef REC_IMP
#define NO_REC_IMP
#endif
// #define DEBUG
#if defined DEBUG
static int reverse_times = 0;
#endif
// todo: use generic for c
int reverse_array(int *array, int start, int end) {
size_t i, j;
int temp;
for (i = start, j = end; i < j; i++, j--) {
temp = array[i];
array[i] = array[j];
array[j] = temp;
}
return 0;
}
int find_max_elem(int *array, int start, int end) {
int i;
int max_elem = start;
for (i = start + 1; i <= end; i++) {
if (array[max_elem] < array[i]) {
max_elem = i;
}
}
return max_elem;
}
#if defined NO_REC_IMP
int pancakeSort(int *unsorted_array, int sort_start, int sort_end) {
int max_elem;
int unsorted_end = sort_end;
for (; unsorted_end > 0; unsorted_end--) {
max_elem = find_max_elem(unsorted_array, sort_start, unsorted_end);
reverse_array(unsorted_array, sort_start, max_elem);
reverse_array(unsorted_array, sort_start, unsorted_end);
}
return 0;
}
#endif
#if defined REC_IMP
int pancakeSort(int *unsorted_array, int start, int end) {
int max_elem = find_max_elem(unsorted_array, start, end);
if (start == end) {
return 0;
}
reverse_array(unsorted_array, start, max_elem);
#if defined DEBUG
reverse_times++;
printf("the %d times reverse:", reverse_times);
for (int i = start; i <= end; i++)
printf("%d ", unsorted_array[i]);
printf("\n");
#endif
reverse_array(unsorted_array, start, end);
pancakeSort(unsorted_array, start, end - 1);
#if defined DEBUG
reverse_times++;
printf("the %d times reverse:", reverse_times);
for (int i = start; i <= end; i++)
printf("%d ", unsorted_array[i]);
printf("\n");
#endif
return 0;
}
#endif
int main() {
int array1[] = {5, 2, 1, 0, 3, 2, 9}; // {5,2,1,0,3,2*,9} => {0,1,2,2*,3,5,9}
int i;
printf("before sort: ");
for (i = 0; i < length_of_array(array1); i++)
printf("%d ", array1[i]);
printf("\n");
pancakeSort(array1, 0, length_of_array(array1) - 1);
printf("after sort: ");
for (i = 0; i < length_of_array(array1); i++)
printf("%d ", array1[i]);
printf("\n");
}