完成第六章测试

Author: jungor

chap04/test_maximum_subarray.c

@@ -16,7 +16,6 @@ static void test_maximum_subarray() {
     CU_ASSERT_EQUAL(slt.sum, 43);
     int nums2[] = {1, 2, -3, 1};
     slt = maximum_subarray(nums2, 0, sizeof(nums2)/sizeof(int), MSA_PLC_LINEAR);
-    printf("%d, %d, %d\n", slt.left, slt.right, slt.sum);
     CU_ASSERT_EQUAL(slt.left, 0);
     CU_ASSERT_EQUAL(slt.right, 1);
     CU_ASSERT_EQUAL(slt.sum, 3);

chap06/test_heap_sort.c

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

chap06/test_heap_sort.h

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

test.c

@@ -1,6 +1,7 @@
 #include "chap02/test_insertion_sort.h"
 #include "chap02/test_merge_sort.h"
 #include "chap04/test_maximum_subarray.h"
+#include "chap06/test_heap_sort.h"
 #include "chap15/test_optimal_binary_search_tree.h"
 #include "utils.h"
 #include <stdio.h>
@@ -25,6 +26,7 @@ int main() {
     CHECK_CU_RETURN(add_test_insertion_sort());
     CHECK_CU_RETURN(add_test_merge_sort());
     CHECK_CU_RETURN(add_test_maximum_subarray());
+    CHECK_CU_RETURN(add_test_heap_sort());
     CHECK_CU_RETURN(add_test_obst());
 
     //使用console控制交互界面的函数入口