Wondershare EdrawMind
EdrawMindData Structure-Algorithm Mind Map
MindMap Gallery Data Structure-Algorithm Mind Map
- 92
- 1
Data Structure-Algorithm Mind Map
An article about data structure-algorithm mind map, @algorithm is a description of the steps to solve a specific problem. @An algorithm is a finite sequence of instructions, a sequence of finite steps to solve a problem, where each instruction Let represent one or more operations.
Edited at 2023-11-28 15:16:46- One Hundred Years of Solitude Character Relationship Chart
One Hundred Years of Solitude is the masterpiece of Gabriel Garcia Marquez. Reading this book begins with making sense of the characters' relationships, which are centered on the Buendía family and tells the story of the family's prosperity and decline, internal relationships and political struggles, self-mixing and rebirth over the course of a hundred years.
- One Hundred Years of Solitude Character Relationship Chart
One Hundred Years of Solitude is the masterpiece of Gabriel Garcia Marquez. Reading this book begins with making sense of the characters' relationships, which are centered on the Buendía family and tells the story of the family's prosperity and decline, internal relationships and political struggles, self-mixing and rebirth over the course of a hundred years.
- Project Management Process Template
Project management is the process of applying specialized knowledge, skills, tools, and methods to project activities so that the project can achieve or exceed the set needs and expectations within the constraints of limited resources. This diagram provides a comprehensive overview of the 8 components of the project management process and can be used as a generic template for direct application.
Data Structure-Algorithm Mind Map
- One Hundred Years of Solitude Character Relationship Chart
One Hundred Years of Solitude is the masterpiece of Gabriel Garcia Marquez. Reading this book begins with making sense of the characters' relationships, which are centered on the Buendía family and tells the story of the family's prosperity and decline, internal relationships and political struggles, self-mixing and rebirth over the course of a hundred years.
- One Hundred Years of Solitude Character Relationship Chart
One Hundred Years of Solitude is the masterpiece of Gabriel Garcia Marquez. Reading this book begins with making sense of the characters' relationships, which are centered on the Buendía family and tells the story of the family's prosperity and decline, internal relationships and political struggles, self-mixing and rebirth over the course of a hundred years.
- Project Management Process Template
Project management is the process of applying specialized knowledge, skills, tools, and methods to project activities so that the project can achieve or exceed the set needs and expectations within the constraints of limited resources. This diagram provides a comprehensive overview of the 8 components of the project management process and can be used as a generic template for direct application.
- Recommended to you
- Outline
No relevant template
algorithm
concept
①An algorithm is a description of the steps to solve a specific problem. ②An algorithm is a finite sequence of instructions, a sequence of finite steps to solve a problem, where each instruction represents one or more operations.
Features
Finiteness
An algorithm can terminate after a finite number of steps and in a finite amount of time.
certainty
①Every instruction in the algorithm must have an exact meaning without ambiguity. ②Under any conditions, there is only one execution path. That is, for the same input, the same output must be produced.
feasibility
The operations described in the algorithm are feasible. The described operations in the algorithm can be realized by a finite number of operations of the implemented basic operations.
There is input
An algorithm has zero or more inputs.
There is output
An algorithm has one or more outputs.
Require
correctness
①Correctness refers to the absence of grammatical errors. ②The accuracy should be able to meet the requirements of specific problems and correctly reflect the needs.
readability
①Readability refers to how easy it is for people to read the algorithm. ②Good readability helps people understand the algorithm.
Robustness
① Robustness mainly refers to the ability to handle errors or abnormal situations. ②When the input data is illegal, the algorithm can handle it appropriately instead of producing inexplicable output results.
Efficiency and storage requirements
①Efficiency describes the execution time of the algorithm, and storage capacity refers to the maximum storage capacity space required during the execution of the algorithm. ② It requires as little time as possible and as low storage requirements as possible.
estimate
Assessment concept
①The most important basis for evaluating the quality of a program algorithm is how much machine resources the program takes up during its execution. Among various machine resources, the most important ones are time resources and space resources. ② Therefore, when analyzing a program, the most important thing everyone is concerned about is the time cost of the algorithm used in the program when it is running and the space cost occupied by the data structures used in the program. ③In other words, time complexity and space complexity are usually used to measure the efficiency of an algorithm.
Evaluation angle
space complexity
time complexity
method
ex ante analysis and estimation method
post hoc statistics
size
O(1)＜O(log2n)＜O(n)＜O(nlog2n)O(n2)＜O(n3)＜O(2n)＜O(n!)O(nn)
Classification
Worst time complexity
Worst time complexity refers to the time complexity of the algorithm in the worst case.
best time complexity
Best time complexity refers to the time complexity of the algorithm in the best case.
average time complexity
The average time complexity refers to the expected running time of the algorithm when all possible input instances occur with equal probability.
question type
Addition principle
Suitable for several independent for loops, not nested within each other
multiplication principle
It is suitable for a nested for loop, and the number of inner and outer for loops is independent of each other.
First term plus last term multiplied by the number of terms divided by two
It is suitable for nesting a for loop, but the times of the inner and outer for loops are not independent and related to each other.
Keep the highest power term principle
It is suitable for directly seeing the number of cycles, retaining the highest power term, and removing the coefficient of the highest power term.
Assume the unknown method
①Suppose the number of cycles is equal to t.
② Find the relationship between t and i by listing the first three or five loop variables and the number of loops. (i here refers to the loop variable)
③ Substitute the equation of t and i found through ② into the loop condition.
④ Solve for the value of t.
⑤ Show the time complexity. (Keep the highest power term, and remove the coefficient of the highest power term.)