Definition:Algorithmic Complexity/Motivation
Jump to navigation
Jump to search
Algorithmic Complexity: Motivation
The increase in use of computers for all sorts of automation projects requires that the algorithms used are as efficient as possible, using as few computer resources as possible.
The study of algorithmic complexity as a way of comparing algorithms has come into prominence as a result.
Also see
- Results about algorithmic complexity can be found here.
Sources
- 1998: David Nelson: The Penguin Dictionary of Mathematics (2nd ed.) ... (previous) ... (next): complexity (of an algorithm)
- 2008: David Nelson: The Penguin Dictionary of Mathematics (4th ed.) ... (previous) ... (next): complexity (of an algorithm)