Http://blog.csdn.net/feixiaoxing/article/details/6993718
[Disclaimer: All Rights Reserved. You are welcome to reprint it. Do not use it for commercial purposes. Contact Email: feixiaoxing @ 163.com]
Written since the beginning of OctoberAlgorithmA series of blogs have written dozens of articles. According to the plan, there are three parts not introduced, mainly (Dijkstra algorithm, binary balancing tree, red and black tree ). This branch is supplemented in the following blog. Here is a summary. If you are interested, take a good look. You are welcome to give your valuable comments.
(1) Sorting Algorithm
Quick sorting
Merge and sort
Heap sorting
Select sort
Base sort
Bubble Sorting
Insert sort
Hill sorting
Sort linked lists
(2) Data Structure
Linear queue
Linear Stack
Unidirectional linked list
Two-way linked list
Cyclic one-way linked list
Sort binary tree (insert, delete, store, and load)
Hash table
Hash Binary Tree
(3) figure
Graph Structure
Figure Creation
Add or delete a graph
Save a graph
Prim algorithm (upper, middle, and lower)
Harman tree (upper and lower)
Cruise Karl algorithm (upper, middle, and lower)
(4) common algorithms
Search
Memory Allocation
String search (top, middle, bottom)
General Data Structure
General Algorithms
Loop and Recursion
Recursion and stack
Data in memory
A * Algorithm
Variable parameters
Function Stack
Recursive pathfinding
Breadth traversal and depth Traversal
Sequencing Binary Tree clue
(5) Interesting algorithm questions
Chain table reversal
Large number calculation
N! Number of last digits 0
Shuffling Algorithm
"Stars"
Queen eight
Data Selection
Word statistics
Climb stairs
Return quantity
Duplicate linked list
Search for lost data
Max common approx., Min. Public multiple
Maximum n count selected