MindMap Gallery Data structures graphs and sorting
Mind map about data structure diagrams and sorting, such as sorting: 1. Direct insertion sort: sentinel = 1, Xiaocai exchange; 2. Hill sorting: difference dk comparison, unstable; 3. Bubble sorting two adjacent ones Compare for (i <= n) for (j <= n-i), stable; 4. Exchange sorting; 5. Simple selection sort traversal to find the best value and put it on one end...
Edited at 2023-10-13 22:12:10Avatar 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. Undirected n(n-1)/2
II. directed n(n-1)
III. Connected graph n-1
IV. Strongly connected graph n
2. storage
3. Traverse
Breadth bfs takes the lead
Level queue (explode the child first in place)
Depth dfs from start to finish
Pre-order stack (go to the lowest point, pop up and explode the child)
4. Minimum spanning tree (without cycles)
prim Prim's algorithm (tree)
One point from small to large weight
kruskal kruskal algorithm (forest)
Whole picture from small to large
5. Shortest path directed and weighted
Dijkstra's algorithm
Each endpoint is set to the outer minimum
O(n²) (adjacency matrix, adjacency list)
Floyd algorithm
Taking a certain point as an intermediary, the comparison directly reaches the minimum.
6. Topological sorting: Repeatedly select the head node (determine no loop)
7. Critical path: AOE network V event point a active edge
Ve event starts at the earliest, takes the longest time, and has a maximum value
Vl things start at the latest, the time is the shortest and the minimum value
e=ve (comes out) is the earliest activity, the previous thing
l=Vl (pointed to)-a itself
Find
sort
1. Direct insertion sort: sentinel = 1, small exchange
o(n^2) o(1)
2. Hill sorting: phase difference dk comparison, unstable
O(nlog2n) o(1)
3. Bubble sort: Adjacent pairwise comparison for (i <= n) for (j <= n-i). Stablize
o(n^2) o(1)
4. swap sort
I. Quick sorting takes away the boundary point 1, compares lh respectively, exchanges the positions, and puts them back if equal. It is similar to optimizing mid=pivotloc and folding it in half. It is unstable.
O(nlog2n) o(log2n)
5. Simple selection sort: traverse to find the best value and put it at one end
6. Heap sort Big root Little root Determination Establishment Adjustment
Adjust MaxMin Exchange Output Drop Exchange
O(nlog2n)
7. Merge sort 11 =2 2=11 The largest space requirement
O(nlog2n)
8. Radix sorting, hundreds of digit sorting, unstable
Summary of sorting knowledge points
time complexity
Quickly hope nlog2n returns to the heap
space complexity
Merge n
stability
I'm emotionally unstable, so I hope I can find some good friends to chat with.
Arrays and generalized tables
stacks and queues
Question: Disconnected graph, node 1