algorithm efficiency

A Dictionary of Computing | 2004 | 700+ words | Copyright

algorithm efficiency A measure of the average execution time necessary for an algorithm to complete work on a set of data. Algorithm efficiency is characterized by its order. Typically a bubble sort algorithm will have efficiency in sorting N items proportional to and of the order of N², usually written O(N²). This is because an average of N/2 comparisons are required N/2 times, giving N²/4 total comparisons, hence of the order of N². In contrast, quicksort has an efficiency O(N log₂N).

If two algorithms for the same problem are of the same order then they are approximately as efficient in terms of computation. Algorithm efficiency is useful for quantifying the implementation difficulties of certain problems.

Cite this article
Pick a style below, and copy the text for your bibliography.

MLA
Chicago
APA

JOHN DAINTITH. "algorithm efficiency." A Dictionary of Computing. 2004. Encyclopedia.com. 27 May. 2012 <http://www.encyclopedia.com>.

JOHN DAINTITH. "algorithm efficiency." A Dictionary of Computing. 2004. Encyclopedia.com. (May 27, 2012). http://www.encyclopedia.com/doc/1O11-algorithmefficiency.html

JOHN DAINTITH. "algorithm efficiency." A Dictionary of Computing. 2004. Retrieved May 27, 2012 from Encyclopedia.com: http://www.encyclopedia.com/doc/1O11-algorithmefficiency.html

Learn more about citation styles