MindMap Gallery Typical algorithm brain map
The knowledge content of typical algorithms includes algorithm overview, branch and bound method, backtracking method, greedy algorithm, dynamic programming, divide and conquer and recursion. I hope the summarized content will be helpful to you!
Edited at 2021-08-10 17:04:39Avatar 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!
algorithm
Divide and Conquer and Recursion
recursion
Basic idea
Typical algorithm
Full arrangement
time complexity
Basic idea
core code
Integer division
time complexity
Basic idea
core code
Tower of Hanoi
time complexity
Basic idea
core code
Advantages and Disadvantages
divide and conquer
Basic idea
Characteristics of problems that can be solved by the divide-and-conquer method
The basic principle
Typical questions
binary search method
time complexity
Basic idea
core code
Multiplication of large numbers
Matrix multiplication
merge sort
time complexity
Derivation of results
https://www.cnblogs.com/sheeva/p/6600666.html
Basic idea
core code
Quick sort
time complexity
Basic idea
core code
Chessboard coverage problem
time complexity
Basic idea
core code
Maximum subsegment sum
time complexity
Basic idea
core code
recurring schedule
time complexity
Basic idea
core code
Select question
time complexity
Basic idea
core code
closest point pair
time complexity
Basic idea
core code
dynamic programming
Basic elements
Algorithm steps
Basic idea
Typical questions
Maximum subsegment sum
time complexity
Basic idea
chart
core code
longest monotonic subsequence
time complexity
Basic idea
chart
core code
shortest path
Basic idea
Fill in the form
digital tower problem
time complexity
Basic idea
core code
Matrix multiplication
time complexity
Basic idea
chart
core code
longest common subsequence
time complexity
Basic idea
chart
core code
0-1 backpack
time complexity
Basic idea
chart
core code
optimal binary search tree
Fill in the form
greedy algorithm
Basic elements
step
Compare with Donggui
Typical questions
backpack problem
time complexity
The basic idea
core code
Event arrangement issues
time complexity
The basic idea
core code
Meeting schedule
The basic idea
code
optimal installation problem
time complexity
The basic idea
core code
Multi-machine scheduling problem
Short jobs first
Long jobs first
Huffman coding problem
time complexity
Basic idea
core code
Single source shortest path - dijkstra
The basic idea
minimum spanning tree
prim algorithm
Basic idea
kruskal algorithm
Basic idea
TSP problem
Basic idea
Backtracking
solution space
solution space tree
Typical solution space tree
subset tree
frame
Arrangement tree
frame
Basic idea
step
Avoid invalid searches
paper cutting function
constraint function
bounding function
Typical questions
Permutation and combination problem
time complexity
core code
Graph coloring problem
Basic idea
core code
After-N problem
time complexity
Basic idea
core code
0-1 backpack problem
time complexity
The basic idea
core code
subset sum problem
time complexity
core code
Integer division problem
time complexity
core code
TSP problem
Basic idea
core code
symbolic triangle problem
branch and bound method
live node table
Comparison between deep search and wide search
step
bounding function
Typical questions
0-1 backpack problem
queue branch and bound method
data structure
Ideas
code
priority queue branch and bound method
data structure
Ideas
code
TSP problem
Ideas
code
time complexity
Eight-digit problem
Ideas
code
Algorithm overview
The form of algorithm expression
The difference between program and algorithm
The quality of the algorithm
properties of algorithms
Algorithmic complexity
time complexity
space complexity
method
asymptotic representation
Big O notation (upper bound representation)
Little o notation (no equal sign for upper bound)
Large Ω notation (lower bound representation)
Small Ω notation (no equal sign in the lower bound)
θ notation
complexity ranking
Difficulty: Greedy strategy
Difficulty: recurrence equation
Difficulty: Pruning function