Remove unnecessary printing (#733)

* 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 space_complexity.c build error.

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

* feat(code/c): Update push_back and pop_back in vector.h

* styles(codes/c): Adjust  format.

* style: Remove unnecessary print.

---------

Co-authored-by: Yudong Jin <krahets@163.com>

codes/cpp/chapter_hashing/simple_hash.cpp

@@ -31,7 +31,6 @@ int xorHash(string key) {
     int hash = 0;
     const int MODULUS = 1000000007;
     for (unsigned char c : key) {
-        cout << (int)c << endl;
         hash ^= (int)c;
     }
     return hash & MODULUS;

docs/chapter_hashing/hash_algorithm.md

@@ -442,7 +442,7 @@ $$
 === "C"
 
     ```c title="built_in_hash.c"
-
+    // C 未提供内置 hash code 函数
     ```
 
 === "Zig"