Algorithmic Efficiency

Get Algorithmic Efficiency essential facts below. View Videos or join the Algorithmic Efficiency discussion. Add Algorithmic Efficiency to your Like2do.com topic list for future reference or share this resource on social media.

## Background

## Overview

### Theoretical analysis

### Benchmarking: measuring performance

### Implementation issues

## Measures of resource usage

### Time

#### Theory

#### Practice

### Space

## Criticism of the current state of programming

## Competitions for the best algorithms

## See also

## References

## External links

This article uses material from the Wikipedia page available here. It is released under the Creative Commons Attribution-Share-Alike License 3.0.

Algorithmic Efficiency

It has been suggested that Analysis of algorithms be merged into this article. (Discuss) Proposed since July 2018. |

In computer science, **algorithmic efficiency** is a property of an algorithm which relates to the number 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. the requirement for high speed, minimum memory usage or some other performance benchmark.

*Note that this article is***not**about optimization, which is discussed in program optimization, optimizing compiler, loop optimization, object code optimizer, etc.

The importance of efficiency with respect to time was emphasised by Ada Lovelace in 1843 as applying to Charles Babbage's mechanical analytical engine:

"In almost every computation a great variety of arrangements for the succession of the processes is possible, and various considerations must influence the selections amongst them for the purposes of a calculating engine. One essential object is to choose that arrangement which shall tend to reduce to a minimum the time necessary for completing the calculation"

^{[1]}

Early electronic computers were severely limited both by the speed of operations and the amount of memory available. In some cases it was realized that there was a space-time trade-off, whereby a task could be handled either by using a fast algorithm which used quite a lot of working memory, or by using a slower algorithm which used very little working memory. The engineering trade-off was then to use the fastest algorithm which would fit in the available memory.

Modern computers are significantly faster than the early computers, and have a much larger amount of memory available (Gigabytes instead of Kilobytes). Nevertheless, Donald Knuth emphasised that efficiency is still an important consideration:

"In established engineering disciplines a 12% improvement, easily obtained, is never considered marginal and I believe the same viewpoint should prevail in software engineering"

^{[2]}

An algorithm is considered efficient if its resource consumption (or computational cost) is at or below some acceptable level. Roughly speaking, 'acceptable' means: it will run in a reasonable amount of time on an available computer. Since the 1950s computers have seen dramatic increases in both the available computational power and in the available amount of memory, so current acceptable levels would have been unacceptable even 10 years ago.

Computer manufacturers frequently bring out new models, often with higher performance. Software costs can be quite high, so in some cases the simplest and cheapest way of getting higher performance might be to just buy a faster computer, provided it is compatible with an existing computer.

There are many ways in which the resources used by an algorithm can be measured: the two most common measures are speed and memory usage; other measures could include transmission speed, temporary disk usage, long-term disk usage, power consumption, total cost of ownership, response time to external stimuli, etc. Many of these measures depend on the size of the input to the algorithm (i.e. the amount of data to be processed); they might also depend on the way in which the data is arranged (e.g. some sorting algorithms perform poorly on data which is already sorted, or which is sorted in reverse order).

In practice, there are other factors which can affect the efficiency of an algorithm, such as requirements for accuracy and/or reliability. As detailed below, the way in which an algorithm is implemented can also have a significant effect on actual efficiency, though many aspects of this relate to optimization issues.

In the theoretical analysis of algorithms, the normal practice is to estimate their complexity in the asymptotic sense, i.e. use Big O notation to represent the complexity of an algorithm as a function of the size of the input **n**. This is generally sufficiently accurate when **n** is large, but may be misleading for small values of **n** (e.g. bubble sort may be faster than quicksort when only a few items are to be sorted).

Some examples of Big O notation include:

Notation | Name | Examples |
---|---|---|

constant | Finding the median from a sorted list of measurements; Using a constant-size lookup table; Using a suitable hash function for looking up an item. | |

logarithmic | Finding an item in a sorted array with a binary search or a balanced search tree as well as all operations in a Binomial heap. | |

linear | Finding an item in an unsorted list or a malformed tree (worst case) or in an unsorted array; Adding two n-bit integers by ripple carry.
| |

linearithmic, loglinear, or quasilinear | Performing a Fast Fourier transform; heapsort, quicksort (best and average case), or merge sort | |

quadratic | Multiplying two n-digit numbers by a simple algorithm; bubble sort (worst case or naive implementation), Shell sort, quicksort (worst case), selection sort or insertion sort
| |

exponential | Finding the (exact) solution to the travelling salesman problem using dynamic programming; determining if two logical statements are equivalent using brute-force search |

For new versions of software or to provide comparisons with competitive systems, benchmarks are sometimes used, which assist with gauging an algorithms relative performance. If a new sort algorithm is produced for example it can be compared with its predecessors to ensure that at least it is efficient as before with known data--taking into consideration any functional improvements. Benchmarks can be used by customers when comparing various products from alternative suppliers to estimate which product will best suit their specific requirements in terms of functionality and performance. For example, in the mainframe world certain proprietary sort products from independent software companies such as Syncsort compete with products from the major suppliers such as IBM for speed.

Some benchmarks provide opportunities for producing an analysis comparing the relative speed of various compiled and interpreted languages for example^{[3]}^{[4]}
and The Computer Language Benchmarks Game compares the performance of implementations of typical programming problems in several programming languages.

(Even creating "do it yourself" benchmarks to get at least some appreciation of the relative performance of different programming languages, using a variety of user specified criteria, is quite simple to produce as this "Nine language Performance roundup" by Christopher W. Cowell-Shah demonstrates by example)^{[5]}

Implementation issues can also have an effect on actual efficiency, such as the choice of programming language, or the way in which the algorithm is actually coded,^{[6]} or the choice of a compiler for a particular language, or the compilation options used, or even the operating system being used. In some cases a language implemented by an interpreter may be much slower than a language implemented by a compiler.^{[3]}

There are other factors which may affect time or space issues, but which may be outside of a programmer's control; these include data alignment, data granuality, garbage collection, instruction-level parallelism, and subroutine calls.^{[7]}

Some processors have capabilities for vector processing, which allow a single instruction to operate on multiple operands; it may or may not be easy for a programmer or compiler to use these capabilities. Algorithms designed for sequential processing may need to be completely redesigned to make use of parallel processing.

Another problem which can arise with compatible processors is that they may implement an instruction in different ways, so that instructions which are relatively fast on some models may be relatively slow on other models; this can make life difficult for an optimizing compiler.

Measures are normally expressed as a function of the size of the input **n**.

The two most common measures are:

*Time*: how long does the algorithm take to complete.*Space*: how much working memory (typically RAM) is needed by the algorithm. This has two aspects: the amount of memory needed by the code, and the amount of memory needed for the data on which the code operates.

For computers whose power is supplied by a battery (e.g. laptops), or for very long/large calculations (e.g. supercomputers), other measures of interest are:

*Direct power consumption*: power needed directly to operate the computer.*Indirect power consumption*: power needed for cooling, lighting, etc.

In some cases other less common measures may also be relevant:

*Transmission size*: bandwidth could be a limiting factor. Data compression can be used to reduce the amount of data to be transmitted. Displaying a picture or image (e.g. Google logo) can result in transmitting tens of thousands of bytes (48K in this case) compared with transmitting six bytes for the text "Google".*External space*: space needed on a disk or other external memory device; this could be for temporary storage while the algorithm is being carried out, or it could be long-term storage needed to be carried forward for future reference.*Response time*: this is particularly relevant in a real-time application when the computer system must respond quickly to some external event.*Total cost of ownership*: particularly if a computer is dedicated to one particular algorithm.

Analyse the algorithm, typically using time complexity analysis to get an estimate of the running time as a function of the size of the input data. The result is normally expressed using Big O notation. This is useful for comparing algorithms, especially when a large amount of data is to be processed. More detailed estimates are needed for algorithm comparison when the amount of data is small (though in this situation time is less likely to be a problem anyway). Algorithms which include parallel processing may be more difficult to analyse.

Use a benchmark to time the use of an algorithm. Many programming languages have an available function which provides CPU time usage. For long-running algorithms the elapsed time could also be of interest. Results should generally be averaged over several tests.

This sort of test can be very sensitive to hardware configuration and the possibility of other programs or tasks running at the same time in a multi-processing and multi-programming environment.

This sort of test also depends heavily on the selection of a particular programming language, compiler, and compiler options, so algorithms being compared must all be implemented under the same conditions.

This section is concerned with the use of main memory (often RAM) while the algorithm is being carried out. As for time analysis above, analyse the algorithm, typically using space complexity analysis to get an estimate of the run-time memory needed as a function as the size of the input data. The result is normally expressed using Big O notation.

There are up to four aspects of memory usage to consider:

- The amount of memory needed to hold the code for the algorithm.
- The amount of memory needed for the input data.
- The amount of memory needed for any output data (some algorithms, such as sorting, often just rearrange the input data and don't need any space for output data).
- The amount of memory needed as working space during the calculation (this includes both named variables and any stack space needed by routines called during the calculation; this stack space can be significant for algorithms which use recursive techniques).

Early electronic computers, and early home computers, had relatively small amounts of working memory. E.g. the 1949 EDSAC had a maximum working memory of 1024 17-bit words, while the 1980 Sinclair ZX80 came initially with 1024 8-bit bytes of working memory.

Current computers can have relatively large amounts of memory (possibly Gigabytes), so having to squeeze an algorithm into a confined amount of memory is much less of a problem than it used to be. But the presence of three different categories of memory can be significant:

- Cache memory (often static RAM) - this operates at speeds comparable with the CPU.
- Main physical memory (often dynamic RAM) - this operates somewhat slower than the CPU.
- Virtual memory (often on disk) - this gives the illusion of lots of memory, and operates thousands of times slower than RAM.

An algorithm whose memory needs will fit in cache memory will be much faster than an algorithm which fits in main memory, which in turn will be very much faster than an algorithm which has to resort to virtual memory. To further complicate the issue, some systems have up to three levels of cache memory, with varying effective speeds. Different systems will have different amounts of these various types of memory, so the effect of algorithm memory needs can vary greatly from one system to another.

In the early days of electronic computing, if an algorithm and its data wouldn't fit in main memory then the algorithm couldn't be used. Nowadays the use of virtual memory appears to provide lots of memory, but at the cost of performance. If an algorithm and its data will fit in cache memory, then very high speed can be obtained; in this case minimising space will also help minimise time. An algorithm which will not fit completely in cache memory but which exhibits locality of reference may perform reasonably well.

- David May FRS a British computer scientist and currently Professor of Computer Science at University of Bristol and founder and CTO of XMOS Semiconductor, believes one of the problems is that there is a reliance on Moore's law to solve inefficiencies. He has advanced an 'alternative' to Moore's law (May's law) stated as follows:
^{[8]}

Software efficiency halves every 18 months, compensating Moore's Law

- May goes on to state:

In ubiquitous systems, halving the instructions executed can double the battery life and big data sets bring big opportunities for better software and algorithms: Reducing the number of operations from N x N to N x log(N) has a dramatic effect when N is large ... for N = 30 billion, this change is as good as 50 years of technology improvements.

- Software author Adam N. Rosenburg in his blog "
*The failure of the Digital computer*", has described the current state of programming as nearing the "Software event horizon", (alluding to the fictitious "*shoe event horizon*" described by Douglas Adams in his*Hitchhiker's Guide to the Galaxy*book^{[9]}). He estimates there has been a 70 dB factor loss of productivity or "99.99999 percent, of its ability to deliver the goods", since the 1980s--"When Arthur C. Clarke compared the reality of computing in 2001 to the computer HAL in his book 2001: A Space Odyssey, he pointed out how wonderfully small and powerful computers were but how disappointing computer programming had become".

The following competitions invite entries for the best algorithms based on some arbitrary criteria decided by the judges:

- Wired magazine
^{[10]}

- Analysis of algorithms--how to determine the resources needed by an algorithm
- Arithmetic coding--a form of variable-length entropy encoding for efficient data compression
- Associative array--a data structure that can be made more efficient using Patricia trees or Judy arrays
- Benchmark--a method for measuring comparative execution times in defined cases
- Best, worst and average case--considerations for estimating execution times in three scenarios
- Binary search algorithm--a simple and efficient technique for searching sorted arrays
- Branch table--a technique for reducing instruction path-length, size of machine code, (and often also memory)
- Comparison of programming paradigms--paradigm specific performance considerations
- Compiler optimization--compiler-derived optimization
- Computational complexity of mathematical operations
- Computational complexity theory
- Computer performance--computer hardware metrics
- Data compression--reducing transmission bandwidth and disk storage
- Database index--a data structure that improves the speed of data retrieval operations on a database table
- Entropy encoding--encoding data efficiently using frequency of occurrence of strings as a criterion for substitution
- Garbage collection--automatic freeing of memory after use
- Green computing--a move to implement 'greener' technologies, consuming less resources
- Huffman algorithm--an algorithm for efficient data encoding
- Improving Managed code Performance--Microsoft MSDN Library
- Locality of reference--for avoidance of caching delays caused by non-local memory access
- Loop optimization
- Memory management
- Optimization (computer science)
- Performance analysis--methods of measuring actual performance of an algorithm at run-time
- Real-time computing--further examples of time-critical applications
- Run-time analysis--estimation of expected run-times and an algorithm's scalability
- Simultaneous multithreading
- Sorting algorithm § Comparison_of_algorithms
- Speculative execution or Eager execution
- Super-threading
- Threaded code--similar to virtual method table or branch table
- Virtual method table--branch table with dynamically assigned pointers for dispatching

**^**Green, Christopher,*Classics in the History of Psychology*, retrieved 2013**^**Knuth, Donald (1974), "Structured Programming with go-to Statements" (PDF),*Computing Surveys*, ACM,**6**(4), archived from the original (PDF) on 24 August 2009, retrieved 2013- ^
^{a}^{b}"Floating Point Benchmark: Comparing Languages (Fourmilog: None Dare Call It Reason)". Fourmilab.ch. 4 August 2005. Retrieved 2011. **^**"Whetstone Benchmark History". Roylongbottom.org.uk. Retrieved 2011.**^**http://www.osnews.com/story/5602**^**Kriegel, Hans-Peter; Schubert, Erich; Zimek, Arthur (2016). "The (black) art of runtime evaluation: Are we comparing algorithms or implementations?".*Knowledge and Information Systems*.**52**(2): 341-378. doi:10.1007/s10115-016-1004-2. ISSN 0219-1377.**^**Guy Lewis Steele, Jr. "Debunking the 'Expensive Procedure Call' Myth, or, Procedure Call Implementations Considered Harmful, or, Lambda: The Ultimate GOTO". MIT AI Lab. AI Lab Memo AIM-443. October 1977.[1]**^**http://www.cs.bris.ac.uk/~dave/iee.pdf**^**http://www.the-adam.com/adam/rantrave/computers.htm**^**Fagone, Jason (29 November 2010). "Teen Mathletes Do Battle at Algorithm Olympics".*Wired*.

This article uses material from the Wikipedia page available here. It is released under the Creative Commons Attribution-Share-Alike License 3.0.

Top US Cities

United States

Like2do.com was developed using defaultLogic.com's knowledge management platform. It allows users to manage learning and research. Visit defaultLogic's other partner sites below: