Difference between revisions of "Algorithmic efficiency"

Revision as of 05:07, 21 August 2015

In computer science, algorithmic efficiency are the properties of an algorithm which relate to the amount of computational resources used by the algorithm.

An algorithm must be analysed to determine its resource usage. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or continuous process.

For maximum efficiency we wish to minimize resource usage. However, the various resources (e.g. time, space) cannot be compared directly, so which of two algorithms is considered to be more efficient often depends on which measure of efficiency is considered the most important, e.g. is the requirement for high speed, or for minimum memory usage, or for some other measure?

Not to be confused with optimization

Note that this article is not about optimization, which is discussed in program optimization, optimizing compiler, loop optimization, object code optimizer, etc. The term 'optimization' is itself misleading, since all that can generally be done is an 'improvement'.

See also

• Algorithm
• Analysis of algorithms

External links

• Algorithmic efficiency @ Wikipedia