Snap

DataEraserC · DataEraserC · commit 2e344a0e4c64 · 2023-12-04T21:19:57.000+08:00
diff --git a/c/pancakeSort/Screenshot_2023-12-03-18-49-20_5200.png b/c/pancakeSort/Screenshot_2023-12-03-18-49-20_5200.png
diff --git a/c/pancakeSort/pancakeSort.c b/c/pancakeSort/pancakeSort.c
@@ -6,6 +6,7 @@
 #define NO_REC_IMP
 #endif
 
+// #define DEBUG
 #if defined DEBUG
 static int reverse_times = 0;
 #endif
diff --git a/c/pancakeSort/pancakeSort_generic.c b/c/pancakeSort/pancakeSort_generic.c
@@ -2,6 +2,7 @@
 
 #define length_of_array(array) sizeof(array) / sizeof(array[0])
 
+// #define DEBUG
 #if defined DEBUG
 static int reverse_times = 0;
 #endif
diff --git a/c/pancakeSort/pancake_sort/Screenshot_2023-12-03-18-49-20_5200.png b/c/pancakeSort/pancake_sort/Screenshot_2023-12-03-18-49-20_5200.png
diff --git a/c/pancakeSort/pancake_sort/slides.md b/c/pancakeSort/pancake_sort/slides.md
@@ -1,7 +1,5 @@
 ---
-author: 测试
-date: 12 01, 2023
-paging: Slide %d / %d
+title: 煎饼排序(pancake sort)
 ---
 
 # 煎饼排序(pancake sort)
@@ -16,7 +14,7 @@ paging: Slide %d / %d
 
 ---
 
-## 题目:
+## 题目要求
 
 给你一个整数数组  `arr` ，请使用 _煎饼翻转_ 完成对数组的排序。
 
@@ -39,7 +37,9 @@ paging: Slide %d / %d
 
 ---
 
-## 尝试解决子问题:将最大元素移动到无序部分的底部
+## 尝试解决子问题:
+
+> 将最大元素移动到无序部分的底部
 
 ### 考虑[3,2,1,4]的一般解法
 
@@ -140,7 +140,7 @@ int find_max_elem(int *array, int start, int end) {
 
 ## 纯 C 语言实现(非泛型)(续)
 
-```c
+```c {all|6-8|14,18-20|all}
 // 非递归煎饼排序
 int pancakeSort_no_rec(int *unsorted_array, int sort_start, int sort_end) {
   int max_elem;
@@ -200,7 +200,7 @@ int find_max_elem(void *array, size_t len, size_t elem_byte_size,
 
 ## 纯 C 语言实现(泛型)(续)
 
-```c
+```c {all|8-11|all}
 // 非递归煎饼排序
 int pancakeSort_no_rec(void *unsorted_array, size_t len, size_t elem_byte_size,
                 int (*compare_function)(const void *a, const void *b),
@@ -221,7 +221,7 @@ int pancakeSort_no_rec(void *unsorted_array, size_t len, size_t elem_byte_size,
 
 ## 纯 C 语言实现(泛型)(续)
 
-```c
+```c {all|8-13|all}
 // 递归煎饼排序
 int pancakeSort_rec(void *unsorted_array, size_t len, size_t elem_byte_size,
                 int (*compare_function)(const void *a, const void *b),
@@ -246,3 +246,15 @@ int pancakeSort_rec(void *unsorted_array, size_t len, size_t elem_byte_size,
 
 - 当最大元素本来就在无序部分底部时无需进行煎饼翻转, 可直接进行扩展有序部分
 - 当最大元素本来就在无序部分顶部时只需翻转一次
+
+---
+
+## 代码运行截图
+
+![替代文本](Screenshot_2023-12-03-18-49-20_5200.png)
+
+---
+
+# That's all
+
+Thanks
diff --git a/c/pancakeSort/煎饼排序.c b/c/pancakeSort/煎饼排序.c
@@ -2,15 +2,15 @@
 
 #define length_of_array(array) sizeof(array) / sizeof(array[0])
 
-#if defined DEBUG
 static int reverse_times = 0;
-#endif
 
 // #define REC_IMP
 #ifndef REC_IMP
 #define NO_REC_IMP
 #endif
 
+static size_t *result_p;
+
 // generic
 int reverse_array(void *array, size_t len, size_t elem_byte_size,
                   int (*swap_function)(const void *a, const void *b)) {
@@ -56,7 +56,11 @@ int pancakeSort(void *unsorted_array, size_t len, size_t elem_byte_size,
   for (; unsorted_len > 0; unsorted_len--) {
     max_elem = find_max_elem(unsorted_array, unsorted_len, elem_byte_size,
                              compare_int);
+    result_p[reverse_times] = max_elem + 1;
+    reverse_times++;
     reverse_array(unsorted_array, max_elem + 1, elem_byte_size, swap_int);
+    result_p[reverse_times] = unsorted_len;
+    reverse_times++;
     reverse_array(unsorted_array, unsorted_len, elem_byte_size, swap_int);
   }
   return 0;
@@ -86,8 +90,18 @@ int pancakeSort(void *unsorted_array, size_t len, size_t elem_byte_size,
 #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 array1[] = {5, 2, 1, 0,
+                  3, 2, 9}; // want: {5,2,1,0,3,2*,9} => {0,1,2,2*,3,5,9}
   size_t i;
-  size_t result[length_of_array(array1)*2];
-
+  size_t result[length_of_array(array1) * 2];
+  result_p = result;
+  pancakeSort(array1, length_of_array(array1), sizeof(int) / sizeof(char),
+              compare_int, swap_int);
+  printf("k值序列:");
+  for (i = 0; i < reverse_times; i++) {
+    printf("%zu ", result[i]);
+  }
+  printf("\n排序结果:");
+  for (i = 0; i < length_of_array(array1); i++)
+    printf("%d ", array1[i]);
 }
