完成第八章测试

Author: jungor

.gitignore

@@ -47,3 +47,8 @@ tags
 compile_commands.json
 .ycm_extra_conf.py
 .color_coded
+
+## 我的自定义文件
+play
+play.c
+

Makefile

@@ -8,7 +8,7 @@ OBJS = $(patsubst %.c, %.o, $(SRCS))
 CC      = gcc 
 CFLAGS  = -Wall -g -std=gnu99
 INCLUDEFLAGS = 
-LDFLAGS = -lcunit
+LDFLAGS = -lcunit -lm
 TARGET = main
 TEST = test
 
@@ -39,7 +39,7 @@ clean:
 	@rm -f $(TARGET) $(OBJS) **/*.d **/*.d.*
 
 .PHONY:debug
-debug:
+debug: all
 	@gdb $(TEST)
 
 .PHONY:dump

chap08/radix_sort.c

@@ -9,30 +9,26 @@
 #include <stdlib.h>
 
 void radix_sort(int nums[], int len) {
-    int *counts = malloc(COUNTING_SORT_NUM_MAX * sizeof(int));
-    int *sorted = malloc(len * sizeof(int));
-    int base = 10;
+    int counts[COUNTING_SORT_NUM_MAX];
+    int sorted[len];
     // 从最低有效位开始为关键字进行计数排序（只要是稳定排序就行）
-    for (int j = 0; j < RADIX_SORT_NUM_MAX_WIDTH; j++) {
+    int max_len = get_dgt_cnt(RAND_MAX);
+    for (int j = 0; j < max_len; j++) {
         for (int i = 0; i < COUNTING_SORT_NUM_MAX; i++) {
             counts[i] = 0;
         }
         for (int i = 0; i < len; i++) {
-            counts[nums[i]%base/(base/10)]++;
+            counts[get_ith_dgt(nums[i], j)]++;
         }
         for (int i = 1; i < COUNTING_SORT_NUM_MAX; i++) {
             counts[i] += counts[i-1];
         }
-        // 必须从后往前遍历，以保证排序的稳定性
         for (int i = len-1; i >= 0; i--) {
-            sorted[counts[nums[i]%base/(base/10)]-1] = nums[i];
-            counts[nums[i]%base/(base/10)]--;
+            sorted[counts[get_ith_dgt(nums[i], j)]-1] = nums[i];
+            counts[get_ith_dgt(nums[i], j)]--;
         }
         for (int i = 0; i < len; i++) {
             nums[i] = sorted[i];
         }
-        base *= 10;
     }
-    free(counts);
-    free(sorted);
 }

chap08/radix_sort.h

@@ -1,7 +1,9 @@
 #ifndef RADIX_SORT
 #define RADIX_SORT
 
-#define RADIX_SORT_NUM_MAX_WIDTH 5
+#include <limits.h>
+#include <stdio.h>
+#include <math.h>
+#define RADIX_SORT_NUM_MAX_WIDTH ((int)floor((log(abs(INT_MAX))/(log(10)))) + 1)
 void radix_sort(int nums[], int len);
-
 #endif

chap08/test_counting_sort.c

@@ -0,0 +1,25 @@
+#include "counting_sort.h"
+#include "test_counting_sort.h"
+#include "../utils.h"
+#include <CUnit/CUnit.h>
+#include <stdlib.h>
+
+static void test_counting_sort() {
+    int len = 10;
+    int nums[len];
+    for (int i = 0; i < len; i++) {
+        nums[i] = rand() % len;
+    }
+    counting_sort(nums, len);
+    for (int i = 1; i < len; i++) {
+        CU_ASSERT(nums[i-1] <= nums[i]);
+    }
+}
+
+CU_ErrorCode add_test_counting_sort() {
+    CU_pSuite pSuite = CU_add_suite("counting_sort", NULL, NULL);
+    CHECK_CU_GLOBAL();
+    CU_ADD_TEST(pSuite, test_counting_sort);
+    CHECK_CU_GLOBAL();
+    return CUE_SUCCESS;
+}

chap08/test_counting_sort.h

@@ -0,0 +1,8 @@
+#ifndef TEST_COUNTING_SORT_H
+#define TEST_COUNTING_SORT_H
+
+#include <CUnit/CUnit.h>
+
+CU_ErrorCode add_test_counting_sort();
+
+#endif

chap08/test_radix_sort.c

@@ -0,0 +1,25 @@
+#include "radix_sort.h"
+#include "test_radix_sort.h"
+#include "../utils.h"
+#include <CUnit/CUnit.h>
+#include <stdlib.h>
+
+static void test_radix_sort() {
+    int len = 100;
+    int nums[len];
+    for (int i = 0; i < len; i++) {
+        nums[i] = rand();
+    }
+    radix_sort(nums, len);
+    for (int i = 1; i < len; i++) {
+        CU_ASSERT(nums[i-1] <= nums[i]);
+    }
+}
+
+CU_ErrorCode add_test_radix_sort() {
+    CU_pSuite pSuite = CU_add_suite("radix_sort", NULL, NULL);
+    CHECK_CU_GLOBAL();
+    CU_ADD_TEST(pSuite, test_radix_sort);
+    CHECK_CU_GLOBAL();
+    return CUE_SUCCESS;
+}

chap08/test_radix_sort.h

@@ -0,0 +1,8 @@
+#ifndef TEST_RADIX_SORT_H
+#define TEST_RADIX_SORT_H
+
+#include <CUnit/CUnit.h>
+
+CU_ErrorCode add_test_radix_sort();
+
+#endif

test.c

@@ -3,6 +3,8 @@
 #include "chap04/test_maximum_subarray.h"
 #include "chap06/test_heap_sort.h"
 #include "chap07/test_quick_sort.h"
+#include "chap08/test_counting_sort.h"
+#include "chap08/test_radix_sort.h"
 #include "chap15/test_optimal_binary_search_tree.h"
 #include "utils.h"
 #include <stdio.h>
@@ -29,6 +31,8 @@ int main() {
     CHECK_CU_RETURN(add_test_maximum_subarray());
     CHECK_CU_RETURN(add_test_heap_sort());
     CHECK_CU_RETURN(add_test_quick_sort());
+    CHECK_CU_RETURN(add_test_counting_sort());
+    CHECK_CU_RETURN(add_test_radix_sort());
     CHECK_CU_RETURN(add_test_obst());
 
     //使用console控制交互界面的函数入口

utils.c

@@ -4,6 +4,8 @@
  */
 #include "utils.h"
 #include <stdio.h>
+#include <math.h>
+
 void print_array(int nums[], int len) {
     printf("[");
     for (int i = 0; i < len; i++) {
@@ -40,17 +42,33 @@ void swap(int nums[], int a, int b) {
     nums[a] = nums[b];
     nums[b] = tmp;
 }
+
 int maxnum(int a, int b) {
     if (a > b) {
         return a;
     } else {
         return b;
     }
 }
+
 int minnum(int a, int b) {
     if (a < b) {
         return a;
     } else {
         return b;
     }
 }
+
+
+int get_ith_dgt(int num, int i) {
+    return num % (int)pow(10, i+1) / (int)pow(10, i); 
+}
+
+int get_dgt_cnt(int num) {
+    int i = 1;
+    while (num > pow(10, i)-1) {
+        i++;
+    }
+    return i;
+}
+

utils.h

@@ -19,10 +19,14 @@
         }                                     \
     }                                         \
     while (0)
-
+/**
+ * 输出数组
+ */
 void print_array(int nums[], int len);
 void print_array2(int **nums, int rows, int cols);
 void swap(int nums[], int a, int b);
 int maxnum(int a, int b);
 int minnum(int a, int b);
+int get_ith_dgt(int num, int i);
+int get_dgt_cnt(int num);
 #endif