MindMap Gallery data structure algorithm
Data structure algorithm (c language version) content framework mind map, including linear tables, stacks, queues, etc., is intuitive and clear, and is very convenient for preview and review.
Edited at 2021-12-06 20:05:23Avatar 3 centers on the Sully family, showcasing the internal rift caused by the sacrifice of their eldest son, and their alliance with other tribes on Pandora against the external conflict of the Ashbringers, who adhere to the philosophy of fire and are allied with humans. It explores the grand themes of family, faith, and survival.
This article discusses the Easter eggs and homages in Zootopia 2 that you may have discovered. The main content includes: character and archetype Easter eggs, cinematic universe crossover Easter eggs, animal ecology and behavior references, symbol and metaphor Easter eggs, social satire and brand allusions, and emotional storylines and sequel foreshadowing.
[Zootopia Character Relationship Chart] The idealistic rabbit police officer Judy and the cynical fox conman Nick form a charmingly contrasting duo, rising from street hustlers to become Zootopia police officers!
Avatar 3 centers on the Sully family, showcasing the internal rift caused by the sacrifice of their eldest son, and their alliance with other tribes on Pandora against the external conflict of the Ashbringers, who adhere to the philosophy of fire and are allied with humans. It explores the grand themes of family, faith, and survival.
This article discusses the Easter eggs and homages in Zootopia 2 that you may have discovered. The main content includes: character and archetype Easter eggs, cinematic universe crossover Easter eggs, animal ecology and behavior references, symbol and metaphor Easter eggs, social satire and brand allusions, and emotional storylines and sequel foreshadowing.
[Zootopia Character Relationship Chart] The idealistic rabbit police officer Judy and the cynical fox conman Nick form a charmingly contrasting duo, rising from street hustlers to become Zootopia police officers!
Program: data structure algorithm)
linear table
Sequence table
Sequence table merge
Basic operations
Create, insert, delete, search, sort
linked list
Different operations select different chain storage structures
One-way linked list
Multiplication and addition of polynomials
Linked list merging
Basic operations
Insertion (tail insertion method, head insertion method)
Linked list creation
delete node
Find node
One-way circular linked list
Synthesis of circular linked list
Doubly linked list
Two-way circular linked list
stack
sequence stack
Basic operations
Create, push onto the stack, pop off the stack, determine if the stack is empty, determine if the stack is full, and get the value of the top element of the stack
Number system conversion
Expression evaluation
bracket matching
Conversion of different expressions of expressions
Tower of Hanoi problem
chain stack
queue
chained queue
Basic operations
Create, push onto the stack, pop off the stack, determine if the stack is empty, determine if the stack is full, and get the value of the top element of the stack
Bank event handling
circular queue
Determine if the stack is empty: the head pointer and tail pointer point to the same storage space
Determine if the stack is full
The head pointer and the tail pointer are adjacent
Queue full flag
string
KMP and its optimization
Find substring
General pattern matching
array
Compressed storage of matrices
row logical adjacency list
column logical adjacency list
Tree
Tree structure basics
Binary tree
Properties of binary trees
sequential storage
chain storage
Preorder traversal (infix representation)
In-order traversal (prefix indicates --- Polish style)
Postorder traversal (suffix representation--reverse Polish style)
Huffman coding optimal binary tree
clue binary tree
Threading of binary trees
trees and forest
Child brother link table
Conversion of trees and binary trees
tree equivalence problem
Travel through the forest first
Hougen traverses the forest
picture
Basic knowledge of graph structures
Adjacency matrix storage
Adjacency list storage
Breadth-limited search
depth first search
minimum spanning tree
Prim's algorithm (starting from point)
Kruskal's algorithm (starting from edges)
shortest path
Freud's algorithm (starting from point)
Dijkstra's algorithm (starting from edges)
critical path (longest path)
topological sort
cross linked list
sort
direct insertion sort
Time O(n2) Space O(1) Stable
half insertion sort
Time O(n2) Space O(1) Stable
Hill sort
Time O(n1.25)~O(1.6n1.25) space O(1) is unstable
bubble sort
Time O(n2) Space O(1) Stable
Quick sort
Time O(nlog2n) Space O(log2n) Unstable
Simple selection sort
Time O(n2) Space O(1) Stable
tree selection sort
Heap sort
Time O(nlog2n) Space O(1) Unstable
bucket sort
Time O(n), space O(n) stable
merge sort
Time O(nlog2n) Space O(n) Unstable
Radix sort
Time O(d(n rd)) Space O(n rd) Stable
Find
Sequence table lookup
Binary search in ordered list
decision tree
decision tree
index sequence table lookup
Binary sorting tree
Find, insert, delete
Balanced tree AVL tree
Find, insert, delete
B-tree
Find, insert, delete
B-tree
Find, insert, delete
key tree
hash table
Constructing the method of division leaving remainders
Conflict handling
Linear detection
secondary detection
random detection