Description: I taught courses at the time of the data structure of the sample written procedures, including the following code:
Long integer: ch0_bigint2.c
Implementation of the order form: ch2_stable.c
List of implementation ch2_ltable.c
Orderly merger of the two tables: ch2_stable_merge.c
Calculated expression: ch3_express.c
Queue implementation chain: ch3_lqueue.c
Chain stack implementation: ch3_lstack.c
Maze Solving: ch3_maze.c
The order of the queue implementation: ch3_squeue.c
The order of the stack implementation: ch3_sstack.c
Parentheses matching test: ch3_sstack_ (). C
Implementation of fixed-length string: ch4_sstring.c
String pattern matching: ch4_string_math.c
Generalized table implementation: ch5_GList.c
Tree traversal: ch6_traverse.c
Insertion Sort: ch10_InsertSort.c
Topological sort and the critical path: ch7_critical_path.c
To Search:
File list (Check if you may need any files):
datastruct_example
..................\ch0_bigint1.c
..................\ch0_bigint2.c
..................\ch10_InsertSort.c
..................\ch10_ShellSort.c
..................\ch2_ltable.c
..................\ch2_stable.c
..................\ch2_stable_merge.c
..................\ch3_express.c
..................\ch3_lqueue.c
..................\ch3_lstack.c
..................\ch3_maze.c
..................\ch3_maze_queue.c
..................\ch3_squeue.c
..................\ch3_sstack.c
..................\ch4_sstring.c
..................\ch4_string_match.c
..................\ch5_GList.c
..................\ch6_traverse.c
..................\ch7_critical_path.c
Download