What is Algorithmic Complexity?
Algorithm complexity refers to the resources required by the algorithm when it is written into an executable program. Resources include time resources and memory resources. Applied to Introduction to Mathematics and Computers.
Algorithm complexity
- Chinese name
- Algorithm complexity
- Foreign name
- Algorithmic Complexity
- influences
- effectiveness
- Classification
- Time complexity and space complexity
- The essential
- Input
- Related
- time complexity
- Application
- Introduction to Mathematics and Computers
- Algorithm complexity refers to the resources required by the algorithm when it is written into an executable program. Resources include time resources and memory resources. Applied to Introduction to Mathematics and Computers.
- The same problem can be solved by different algorithms, and the quality of an algorithm will affect the efficiency of the algorithm and even the program. The purpose of algorithm analysis is to select appropriate algorithms and improve them. The evaluation of an algorithm is mainly from
- (1) Time frequency
- The time it takes for an algorithm to execute cannot be calculated in theory. You must run the test on the computer to know. But we cannot and do not need to test each algorithm on the computer, we only need to know which algorithm takes more time and which algorithm takes less time. And the time taken by an algorithm and the number of statements executed in the algorithm
- versus
- The complexity of an algorithm is usually determined by its input. As the input increases,
- the complexity
- In order to reduce the complexity of the algorithm, a better algorithm should be designed taking into account the amount of input.