MindMap Gallery Design and Analysis of Algorithms
Algorithm design and analysis mind map for soft exam review
Edited at 2019-04-18 15:26:14Avatar 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!
Design and Analysis of Algorithms
basic concept
An algorithm is a description of the steps to solve a specific problem. It is a finite sequence of instructions, each of which represents one or more operations.
algorithm design
divide and conquer
Break a large, difficult-to-solve problem into smaller identical problems
merge sort
dynamic programming
For problems that are suitable to be solved by dynamic programming, the sub-problems obtained after decomposition are often not independent.
Suitable for the situation
optimal substructure
overlapping subproblems
greedy method
Make strategic choices based on information. Once a choice is made, it will not change regardless of the outcome.
Suitable for the situation
optimal substructure
greedy choice property
Backtracking
A general problem-solving method that systematically searches for all or any solution to a problem. Algorithms with systematic and jumping properties
branch and bound method
Similar to the backtracking method, it is an algorithm that searches for the solution of the problem on the solution space tree T of the problem.
type
queue
priority queue branch and bound method
Probabilistic algorithm
approximation algorithm
Analysis of Algorithms
Algorithm analysis refers to estimating the resources required by an algorithm. The more resources required, the higher the complexity of the algorithm.
Algorithm representation
natural language
flow chart
programming language
pseudocode
Algorithm analysis basics
time complexity
Since time complexity and space complexity analyze the time and space resources occupied by the algorithm respectively, the calculations are similar, and the space complexity analysis is relatively simple.
progressive symbol
O mark
Give an asymptotic upper bound on the running time of an algorithm
Ώ
Use this notation to give an asymptotic lower bound on the running time of an algorithm
Θ
Use this notation to give an asymptotic upper bound and asymptotic lower bound on the running time of an algorithm, that is, an asymptotic compact bound.
Recursive
non-recursive algorithm
expansion method
substitution method
recursive tree algorithm