Refresh algorithm (0) -- directory

Now it's time to regain basic algorithms and grasp algorithm thinking. The following table lists the algorithms to be learned.

1 algorithm 2 KMP 3 tree 4 traverse Binary Tree 5 clue Binary Tree 6 Hoffman tree 7 fig 8 DEEP first search 9 breadth first search 10 minimum spanning tree 11 Shortest Path 12 topological sorting 13 Key Path 14 search search for a linear table with a 16-fold query of 17 trees 18 binary sorting tree 19 balanced binary tree 20 B-tree 21 B + tree 22 hash List Search 23 constructor 24 methods for dealing with conflicts 25 search 26 sort 27 insert sort 28 insert sort 29 insert half insert sort 30 Hill sort 31 switch sort 32 bubble sort 33 fast sort 34 select sort 35 simple select sort 36 Heap Sort 37 merge sort 38 sort by base 39 multiple keywords 40 sort by chain base 41

Basic algorithm list

My plan is to follow the sequence in the above table to understand the Implementation ideas of each algorithm in sequence, then use C # to implement it, and then reflect on its essence. In this process, a basic algorithm library (DLL) is obtained gradually ).