hello-algo/codes/c/CMakeLists.txt

cmake_minimum_required(VERSION 3.10)
project(hello_algo C)

set(CMAKE_C_STANDARD 11)

include_directories(./include)

add_subdirectory(chapter_computational_complexity)
add_subdirectory(chapter_array_and_linkedlist)
add_subdirectory(chapter_stack_and_queue)
add_subdirectory(chapter_heap)
add_subdirectory(chapter_hashing)
add_subdirectory(chapter_tree)
add_subdirectory(chapter_searching)
add_subdirectory(chapter_sorting)
add_subdirectory(chapter_graph)
feat(codes/c): add C include/ codes and modify exist C codes 2023-01-11 00:48:48 +08:00			`cmake_minimum_required(VERSION 3.10)`
			`project(hello_algo C)`

			`set(CMAKE_C_STANDARD 11)`

			`include_directories(./include)`

			`add_subdirectory(chapter_computational_complexity)`
			`add_subdirectory(chapter_array_and_linkedlist)`
feat(codes/c/): add array_stack and linkedlist_stack frame 2023-01-12 21:09:51 +08:00			`add_subdirectory(chapter_stack_and_queue)`
feat: add C array hash map (#424) * feat: add C hash map * fix: hash map put bug * fix: C array hash map * fix: Incorrect indentation * refactory array hash map * remove header * refactory print * 修改注释 * replace all the Tab with 4 spaces * 向 cpp 靠拢 * 删除错误注释 * delete <stdlib.h> * delete array_hash_map.h * Update array_hash_map.c --------- Co-authored-by: Yudong Jin <krahets@163.com> 2023-04-23 23:44:49 +08:00			`add_subdirectory(chapter_heap)`
			`add_subdirectory(chapter_hashing)`
Represent null with INT_MAX in C, C++. 2023-04-18 14:31:23 +08:00			`add_subdirectory(chapter_tree)`
Refactor the articles related to searching algorithm. Add the chapter of binary search. Add the section of searching algorithm revisited. (#464) 2023-04-17 18:22:18 +08:00			`add_subdirectory(chapter_searching)`
feat: Add C codes for bucket sort, heap sort, selection sort, binary search edge (#525) * 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> 2023-06-02 02:51:35 +08:00			`add_subdirectory(chapter_sorting)`
add C code for graph (#583) * 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 2023-07-11 23:50:51 +08:00			`add_subdirectory(chapter_graph)`