完成第七章测试

Author: jungor

chap06/test_heap_sort.c

@@ -4,7 +4,7 @@
 #include <CUnit/CUnit.h>
 #include <stdlib.h>
 
-static void test_insertion_sort() {
+static void test_heap_sort() {
     int len = 100;
     int nums[len];
     for (int i = 0; i < len; i++) {
@@ -19,7 +19,7 @@ static void test_insertion_sort() {
 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);
+    CU_ADD_TEST(pSuite, test_heap_sort);
     CHECK_CU_GLOBAL();
     return CUE_SUCCESS;
 }

chap07/test_quick_sort.c

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

chap07/test_quick_sort.h

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

test.c

@@ -2,6 +2,7 @@
 #include "chap02/test_merge_sort.h"
 #include "chap04/test_maximum_subarray.h"
 #include "chap06/test_heap_sort.h"
+#include "chap07/test_quick_sort.h"
 #include "chap15/test_optimal_binary_search_tree.h"
 #include "utils.h"
 #include <stdio.h>
@@ -27,6 +28,7 @@ int main() {
     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_quick_sort());
     CHECK_CU_RETURN(add_test_obst());
 
     //使用console控制交互界面的函数入口