1. Clion必须以Project的项目存在,默认一个项目必须并且只能有一个main方法的.c文件
2. 把需要执行的C文件,放到CMakeList文件里面,比如main.c。
3. 如果还有其他的ADT文件,把其他的ADT文件也放到CMakeList文件里面(把我注释掉的替换掉)
4. 右键 点击run 执行C语言的项目
* Algorithms in C, Parts 1-4, Robert Sedgewick
* Algorithms in C, Part 5, Robert Sedgewick
* Programming, Problem Solving, and Abstraction with C
* C语言与数据结构
* http://www.runoob.com/cprogramming/c-tutorial.html
* https://www.w3cschool.cn/c/
* https://leetcode.com/
* https://www.cs.usfca.edu/~galles/visualization/Algorithms.html
* https://people.ok.ubc.ca/ylucet/DS/
how to store data inside a computer for efficient use.
step-by-step process for solving a problem. (within a mount of space and time)
* https://www.cnblogs.com/onepixel/p/7674659.html
* insertion sorting
* bubble sorting
* merge sorting
* binary search
* stack
* queue
* priority stack and primary queue
* priority queue (insert O(logN),push,pop)
structure (结构体)一堆的需要定义的数据类型,data,day
* data structures of Single LinkedList and Double LinkedList
* Init,Insert,Update,Delete,Free,Show
* LinkedList Searching, LinkedList Sorting
* LinkedList Stack and LinkedList Queue
* Algorithms Complexity.
* Graph Representation
* Graph Searching
* Hamiltonian Path and Circuit(all vertices)
* Euler Path and Circuit(all edges)
* Graph Algorithms(BFS,DFS,Weight Graph,Directed Graph ,Minimum Spanning Trees,Kruskal's Algorithm,Prim's Algorithm,Dijkstra's Algorithm)
* Kruskal's Algorithm (consider all the edges,push to priority queue, then pop from the minimum weighted edge)
* Prim's Algorithm (start from vertex, consider all the minimum edges with the connected vertex,then add to used edges)
* Dijkstra's Algorithm(start from vertex,consider all the minimum edges with the connected vertex, find the combined minimum edges)
* init, insert,update, delete, free ,show, post order,pre order, inorder
* binary tree
* height,width,level
* AVL tree,Splay tree, 2-3-4 Tree, black-red tree.
* Boyer-Moore Algorithm
* Knuth-Morris-Pratt Algorithm
* Word Matching With Tries
* Huffman Code
COMP9024公开资料,更多资料加我微信: