MindMap Gallery data structure
The data structure mind map is as follows for your reference.
Edited at 2020-09-17 13:43:57Avatar 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!
data structure
linear table
Tree
clue binary tree
Huffman tree
picture
1. basic concept
I. complete graph
undirected complete graph
There is an edge between any two points, and the entire graph has n(n-1)/2 edges.
Directed complete graph
There is an arc between any vertex and the remaining points, that is, there are n (n-1) arcs.
II. connected graph
If there is a path between any two points in an undirected graph G, then G is called a connected graph.
An undirected connected graph with n vertices has at least n-1 edges.
III. Strongly connected graph
If any two points in a directed graph can reach each other, it is called a strongly connected graph.
2. minimum spanning tree
3. shortest path
Dijkstra's algorithm
Calculate the shortest path from a certain vertex to all other vertices
time complexity
O(n²) (adjacency matrix, adjacency list)
sort
1. insertion sort
I. direct insertion sort
II. Hill sort
O(nlog2n)
2. swap sort
I. Bubble Sort
II. Quick sort
O(nlog2n)
3. selection sort
I. Direct selection sort
II. Heap sort
O(nlog2n)
4. Radix sort
5. merge sort
O(nlog2n)
6. external sort
Summary of sorting knowledge points
time complexity
Quickly hope nlog2n returns to the heap
space complexity
stability
I'm emotionally unstable, so I hope I can find some good friends to chat with.
Find
Arrays and generalized tables
stacks and queues