* 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
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* fix "$" in c_c summary and add QA of array_linklist in summary
* Update summary.md
* Update summary.md
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* add Q&A in the summary.md of computational complexity chapter
* add Q&A in the summary.md of graph
* Update summary.md
* Update summary.md
* Update summary.md
* Update summary.md
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* Update hash_collision.md
a detailed description of the conditions for converting a linked list into a red-black tree is as follows.
```java
final void treeifyBin(Node<K,V>[] tab, int hash) {
int n, index; Node<K,V> e;
if (tab == null || (n = tab.length) < MIN_TREEIFY_CAPACITY)
}
```
* Update hash_collision.md
---------
Co-authored-by: Yudong Jin <krahets@163.com>
gonglja
Yudong Jin
hpstory
liuyuxin
Reanon
nuomi1
Sizhuo Long
xBLACKICEx
Jefferson Huang
Suremotoo