MindMap Gallery [408]Data structures and algorithms
Data structures and algorithms include introduction, linear lists, queues, arrays, matrices, generalized lists, graphs, sorting, and search. Friends who are interested in data structures and algorithms can take a look~
Edited at 2023-03-14 21:58:11One Hundred Years of Solitude is the masterpiece of Gabriel Garcia Marquez. Reading this book begins with making sense of the characters' relationships, which are centered on the Buendía family and tells the story of the family's prosperity and decline, internal relationships and political struggles, self-mixing and rebirth over the course of a hundred years.
One Hundred Years of Solitude is the masterpiece of Gabriel Garcia Marquez. Reading this book begins with making sense of the characters' relationships, which are centered on the Buendía family and tells the story of the family's prosperity and decline, internal relationships and political struggles, self-mixing and rebirth over the course of a hundred years.
Project management is the process of applying specialized knowledge, skills, tools, and methods to project activities so that the project can achieve or exceed the set needs and expectations within the constraints of limited resources. This diagram provides a comprehensive overview of the 8 components of the project management process and can be used as a generic template for direct application.
One Hundred Years of Solitude is the masterpiece of Gabriel Garcia Marquez. Reading this book begins with making sense of the characters' relationships, which are centered on the Buendía family and tells the story of the family's prosperity and decline, internal relationships and political struggles, self-mixing and rebirth over the course of a hundred years.
One Hundred Years of Solitude is the masterpiece of Gabriel Garcia Marquez. Reading this book begins with making sense of the characters' relationships, which are centered on the Buendía family and tells the story of the family's prosperity and decline, internal relationships and political struggles, self-mixing and rebirth over the course of a hundred years.
Project management is the process of applying specialized knowledge, skills, tools, and methods to project activities so that the project can achieve or exceed the set needs and expectations within the constraints of limited resources. This diagram provides a comprehensive overview of the 8 components of the project management process and can be used as a generic template for direct application.
[408] Data structures and algorithms
1 Introduction
time complexity
space complexity
Basic concepts of data structure
Basic concepts of algorithms
2 Linear table
basic concept
accomplish
Structure definition
operate
Sequence table
Single list
Double linked list
circular linked list
Inversion problem (*)
3 Stacks and Queues
basic concept
storage structure
stack
sequence stack
chain stack
shared stack
queue
sequential team
chain team
deque
application
stack application
Queue configuration issues
abstract data type
4 skewers
definition
storage structure
Basic operations
string pattern matching
Simple pattern matching algorithm
KMP algorithm
KMP improved algorithm
5 Arrays, matrices, generalized tables
array
Compressed storage of matrices
Ordinary matrix
special matrix
sparse matrix
generalized table
6 Trees and Binary Trees
Tree
definition
the term
storage structure
Binary tree
definition
nature
storage structure
Traversal algorithm
Binary tree traversal
Improve
tree traversal
forest traversal
Convert
Tree => Binary tree
Binary tree => tree
Forest => Binary tree
Binary tree => forest
application
Binary sorting tree
balanced binary tree
huffman tree
Huffman coding
7 pictures
basic concept
storage structure
adjacency matrix
adjacency list
adjacency multiple list
Traversal algorithm
depth first search traversal
breadth first search traversal
Minimum spanning tree (minimum cost)
Prim's algorithm
Kruscal algorithm
shortest path algorithm
Dijkstra's algorithm
Floyd algorithm
topological sort
AOV network
algorithm
Critical Path
AOE network
algorithm
8 Sort
basic concept
sort
stability
Classification
Insert class
direct insertion sort
half insertion sort
Hill sort
exchange class
Bubble Sort
Quick sort
Select class
Simple selection sort
Heap sort
merge sort
Radix sort
external sort
Concepts and Processes
permutation-selection sort
best merge tree
loser tree
Complexity related issues
Difficulties
9 Find
basic concept
sequential search
half search
Block search
Binary sorting tree
balanced binary tree
B-/B-tree
B-tree
basic concept
operate
B-tree
basic concept
hash table
concept
Create method
conflict resolution
Performance analysis