Original: Step by step write algorithm (algorithm summary)
"Disclaimer: Copyright, welcome reprint, please do not use for commercial purposes. Contact mailbox: feixiaoxing @163.com "
Since the beginning of October to write the algorithm series of blogs, the land has been written dozens of articles. According to the plan, there are three parts of the content is not introduced, mainly (Dijkstra algorithm, binary balance tree, red-black tree). This section will be supplemented in the following blog complete. Here is mainly to do a summary, interested friends can take a good look, welcome everyone to put forward valuable comments.
(1) Sorting algorithm
Quick Sort
Merge sort
Heap Sort
Select sort
Base sort
Bubble sort
Insert Sort
Hill sort
List sort
(2) data structure
Linear queue
Linear stack
One-way linked list
Doubly linked list
Circular unidirectional linked list
Sort binary tree (insert, delete top, bottom, save, and load)
Hash table
Hash binary Tree
(3) Figure
Graph structure
Diagram creation
Diagram additions, deletions
Saving of graphs
Prim algorithm (top, middle, and bottom)
Huffman tree (up, down)
Kruskal algorithm (top, middle, and bottom)
(4) Common algorithms
Find
Memory allocation
String lookup (top, middle, bottom)
General data structure
General algorithm
Loops and recursion
Recursion and Stack
In-memory data
A * algorithm
Variable parameters
function stacks
Recursive path finding
Breadth traversal, deep traversal
Sequencing binary tree Cues
(5) Interesting algorithm topics
Linked list reversal
Large number calculation
N! 0-digit Calculation
Shuffle algorithm
"Count the Stars."
Eight Queens
Data selection
Word statistics
Climbing stairs
Number of returns
Linked list coincident
Look for the missing number
Greatest common divisor, least common multiple
Select the maximum number of n
Transferred from: http://blog.csdn.net/feixiaoxing/article/details/6993718
Step-by-step write algorithm (algorithm summary)