Fix quadraticRecur bug in space_complexity.c (krahets#651)

* fix(codes/cpp): Memory leak fix: the space was not freed when pop removed the element.

* fix(codes/cpp): Fix access error when printArray(arr, 0)

* Update PrintUtil.hpp

* fix(codes/c): Fix some errors of cmake build

* feat(codes/c): Add hashing_search.c

* styles(codes/c): Modify function description

* styles(codes/c): Modify binary_search.c code style

* fix(codes/c): Fix the problem in binary_tree_bfs.c and the problem that the memory is not released.

* feat: Add preorder_traversal_i_compact.c

* feat(codes/c): Add head_sort.c

* feat(codes/c): Add bucket_sort.c

* feat(codes/c): Add binary_search_edge.c

* fix(codes/c): Add programs that are not managed by cmake (c code)

* feat(codes/c): Add selection_sort.c

* style(codes/c): Change swap in selection_sort.c to `selectionSort`

* styles(codes/c): Change style.

* fix(codes/c): Fix some formatting errors and temporarily remove backtracking chapters

* fix(codes/c): Fix quadraticRecur bug in `space_complexity.c`

---------

Co-authored-by: Yudong Jin <[email protected]>

codes/c/chapter_computational_complexity/space_complexity.c

@@ -106,8 +106,9 @@ int quadraticRecur(int n) {
         return 0;
     int *nums = malloc(sizeof(int) * n);
     printf("递归 n = %d 中的 nums 长度 = %d\r\n", n, n);
+    int res = quadraticRecur(n - 1)
     free(nums);
-    return quadraticRecur(n - 1);
+    return res;
 }
 
 /* 指数阶（建立满二叉树） */