Data structure and Algorithm series catalog
Recently took time to collate the "data structure and algorithm" related articles. In the finishing process, for each data structure and algorithm to give the "C", "C + +" and "Java" the implementation of the three languages, the implementation of the language is different, but the principle is the same. Therefore, the reader in the process of understanding and learning, choose one of them!
The following is the collation of data and algorithms of the table of contents, for each kind according to C/c++/java division, convenient to consult. If there are errors or omissions in the article, please do not hesitate to correct me. Thank you!
data structure and algorithm catalog table
|
C |
C++ |
Java |
Linear structure |
1. Arrays, single-linked lists and doubly linked lists 2. The classic implementation of the bidirectional linked list in the Linux kernel |
Arrays, single-linked lists, and double-linked lists |
Arrays, single-linked lists, and double-linked lists |
Stack |
Stack |
Stack |
Queue |
Queue |
Queue |
Tree-shaped structure |
Binary search Tree |
Binary search Tree |
Binary search Tree
|
AVL Tree |
AVL Tree |
AVL Tree |
stretch tree |
stretch tree |
< Span style= "font-size:14px" > extension tree |
1. the principles and algorithms of the Red-black tree (i) Details 2. the implementation of the C language of the Red and Black Tree (ii) 3. Red and Black Tree (c) The classic implementation of red and black trees in the Linux kernel 4. Red and Black Tree (vi) references |
1. the principles and algorithms of the Red-black Tree (a) detailed introduction Span style= "FONT-SIZE:14PX" >2. the implementation of C + + of red-black Tree (iv) 3. Red-black tree ( Vi. references |
1. Red-black tree (i) Principles and algorithms details 2. the implementation of Java in red-black Tree (v) 3. Red and Black Tree (vi) references |
Huffman Tree |
Huffman Tree |
Huffman Tree |
... |
|
|
Heap |
Two-fork Pile |
Two-fork Pile |
Two-fork Pile |
Left-leaning heap |
Left-leaning heap |
Left-leaning heap |
Oblique heap |
Oblique heap |
Oblique heap |
Two-item heap |
Two-item heap |
Two-item heap |
Fibonacci Heap |
Fibonacci Heap |
Fibonacci Heap |
... |
|
|
figure |
|
|
|
1. adjacency matrix no map 2. adjacency Table no map 3. adjacency matrix forward graph 4. adjacency table graph |
1. adjacency matrix no map 2. adjacency Table no map 3. adjacency matrix forward graph 4. adjacency table graph |
1. adjacency matrix no-map 2. adjacency Table no map Span style= "font-size:14px" >3. adjacency matrix forward graph 4. adjacency table forward graph |
Depth-first search and breadth-first search |
Depth-first search and breadth-first search |
Depth-first search and breadth-first search |
Topological sorting |
Topological sorting |
Topological sorting |
Kruskal algorithm |
Kruskal algorithm |
Kruskal algorithm |
Prim algorithm |
Prim algorithm |
Prim algorithm |
Dijkstra algorithm |
|
|
... |
|
|
Sorting algorithms |
Bubble sort |
Bubble sort |
Bubble sort |
Quick Sort |
Quick Sort |
Quick Sort |
Direct Insert Sort |
Direct Insert Sort |
Direct Insert Sort |
Hill sort |
Hill sort |
Hill sort |
Select sort |
Select sort |
Select sort |
Heap Sort |
Heap Sort |
Heap Sort |
Merge sort |
Merge sort |
Merge sort |
Bucket sort |
Bucket sort |
Bucket sort |
Base sort |
Base sort |
Base sort |
... |
|
|
|
|
|
|
Depth analysis (a) data structure and algorithm series catalog