* 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>
* feat(chapter_dynamic_programming): Add js and ts codes for chapter 14.1
* style(chapter_dynamic_programming): format code
* refactor(chapter_dynamic_programming): remove main definition and add type
* 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>
* feat: Add Go code to binary search recursion under divide and conquer
* style: Code comment standardization
* style: modify function comment
* fix: fixed error when the list is empty
* Update print_utils.go
* Delete print_utils_test.go
* feat: add Go code to divide and conquer
* Update build_tree.go
* style: modify function name
---------
Co-authored-by: Yudong Jin <krahets@163.com>
* feat: Add Go code to binary search recursion under divide and conquer
* style: Code comment standardization
* style: modify function comment
* fix: fixed error when the list is empty
* Update print_utils.go
* Delete print_utils_test.go
---------
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>
* feat: add Swift codes for intro_to_dynamic_programming article
* feat: add Swift codes for dp_problem_features article
* feat: add Swift codes for dp_solution_pipeline article
* feat: add Swift codes for knapsack_problem article
* feat: add Swift codes for unbounded_knapsack_problem article
* feat: add Swift codes for edit_distance_problem article
