* feat: tranlating n_queens.c
* Reference to c++ code with additional comments
* Update n_queens.c
* Update n_queens.c
* Format n_queens.c
* Update n_queens.c
keep the file header information format consistent with others
* fine tune
* fine tune
* Delete mkdocs-en.yml
* Update README.md
---------
Co-authored-by: krahets <krahets@163.com>
* 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.
* feat(codes/c): Add `interation.c ` `recursion.c` `simple_hash.c` `binary_search_edge.c` `binary_search_insertion.c` in C codes.
* fix(mylist.c): Fix `insert` function in `mylist.c`
https://github.com/krahets/hello-algo/discussions/32#discussioncomment-6974163
* fix(array.c): Fix unreleased memory error
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* 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.
* feat(codes/c): Add `interation.c ` `recursion.c` `simple_hash.c` `binary_search_edge.c` `binary_search_insertion.c` in C codes.
* fix(mylist.c): Fix `insert` function in `mylist.c`
https://github.com/krahets/hello-algo/discussions/32#discussioncomment-6974163
* fix(linkedlist_queue.c): Fix linkedlist_queue.c print error
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* 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.
* feat(codes/c): Add `interation.c ` `recursion.c` `simple_hash.c` `binary_search_edge.c` `binary_search_insertion.c` in C codes.
* fix(mylist.c): Fix `insert` function in `mylist.c`
https://github.com/krahets/hello-algo/discussions/32#discussioncomment-6974163
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* 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.
* feat(codes/c): Add `interation.c ` `recursion.c` `simple_hash.c` `binary_search_edge.c` `binary_search_insertion.c` in C codes.
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* 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.
* fix(codes/c/chapter_heap): Fix my_head.c build error.
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* feat: Add C codes for chapter_hashing
* fix:Make corrections to the formatting
* fix:Fixing Test Cases
* fix:Fixing Test Cases
* fix:revised format
* Update hash_map_chaining.c
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* 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.
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* 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.
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* 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
* feat(codes/c): Add part of the c code in the backtracking chapter
* feat(codes/c): Add preorder_traversal_iii_compact.c
* feat(codes/c): Add preorder_traversal_iii_template.c
* feat(codes/c): Add permutations_i.c
* style(codes/c): Adjust the format
* feat(codes/c): Add memory release in chapter_backtracking
* fix(codes/c): Fix memory release issue.
* style(codes/c): Update format and Merge duplicate code
* style(code/c): Change print format in preorder_traversal_iii_template.c
* Update preorder_traversal_iii_template.c
* Update permutations_i.c
* feat(codes/c): Remove myArray, use public vector.
* feat(codes/c): Add subset_sum_i_naive.c in C codes.
* feat(codes/c): Add permutations_i in CMakeLists.txt
* feat(codes/c): Update printf function in vector.h.
* feat(codes/c): Add subset_sum_i.c and subset_sum_ii.c
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* 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 <krahets@163.com>
* Create chapter_graph
* Delete chapter_graph
* add C code for graph
* add C code for graph
* Create graph_adjacency_list.c
add C code for graph
* Update CMakeLists.txt
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update graph_adjacency_list.c
* Update CMakeLists.txt for c code of graph
* Update format of c code
* Update format of c code
* Update format of c code
* Update verticesList
Change the data structure of the storage list from a linked list to a linear table
* Update graph_adjacency_list.c
* Update graph_adjacency_matrix.c
* Create graph_adjacency_list_test.c
* Create graph_bfs
* Update CMakeLists.txt
* Update graph_adjacency_list.c
* mv graph_bfs to graph_bfs.c
* Update graph_bfs.c
* Delete graph_bfs
* Update graph_adjacency_list.c
* update c code for graph operation.
* Update CMakeLists.txt
* Update graph_dfs.c
* Update graph_dfs.c
* Update CMakeLists.txt
* Update graph_dfs.c
* Update note of graph_dfs.c
* Update graph_bfs.c
* Update graph_dfs.c
* Update graph_bfs.c
* Update output "初始化后，图为：" of graph_dfs.c
* Update graph_dfs.c
* Update graph_bfs.c
* Update graph_dfs.c
* Update name of arrayVertex
* Update name of arrayVertex
* Update note of graph_dfs.c
* Update note of graph_bfs.c
* Update graph_dfs.c
* Update graph_bfs.c
* Update graph_adjacency_matrix.c
* Update graph_adjacency_list_test.c
* Update graph_adjacency_list.c
* Update graph_dfs.c
* Update graph_bfs.c
* Update comment
* Update comment
* Update graph_adjacency_list.c
* Update graph_adjacency_matrix.c
* update comment
* update comment
* update comment for graph operation
* update comment of graph operation
* update comment
* update comment
---------
Co-authored-by: Yudong Jin <krahets@163.com>
Co-authored-by: libr <libr@info2soft.com>
* Create chapter_graph
* Delete chapter_graph
* add C code for graph
* add C code for graph
* Create graph_adjacency_list.c
add C code for graph
* Update CMakeLists.txt
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update format and output
* Update graph_adjacency_list.c
* Update CMakeLists.txt for c code of graph
* Update format of c code
* Update format of c code
* Update format of c code
* Update verticesList
Change the data structure of the storage list from a linked list to a linear table
* Update graph_adjacency_list.c
* Update graph_adjacency_matrix.c
* Create graph_adjacency_list_test.c
* Create graph_bfs
* Update CMakeLists.txt
* Update graph_adjacency_list.c
* 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(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.
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* 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
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* 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
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* 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)
* fix(codes/cpp): Fix memory leaks: replace pointers with local variables, no need to manage memory
* fix(codes/cpp): Fix memory leaks: no delete
* fix(codes/cpp): Fix memory leaks: Add destructor ~ArrayHashMap()
* Update PrintUtil.hpp
* feat(codes/c): Add three-party hash implementation
* feat(codes/c): Add freeMemoryTree in tree_node.h
* feat(codes/c): Add space_complexity.c
* styles(codes/c): Modify format
* feat(codes/cpp): Undo a previous delete, there is no memory leak here
* Update array_hash_map.cpp
* Update include.h
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* feat(go/counting_sort): support counting_sort in go
* feat(test): support counting_sort_naive testcase
* feat(go/counting_sort): support counting sort
* feat(c/counting_sort): support counting_sort in c
krahets
lclc6
FreddieLi
lucas
王作勋
花无缺
xianii
gonglja
xianii
MwumLi
linweibin
XiaChuerwu
Reanon
NI-SW
Guanngxu