**Algorithmic Efficiency**

In computer science, **efficiency** is used to describe properties of an algorithm relating to how much of various types of resources it consumes. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or continuous process, where the goal is to reduce resource consumption, including time to completion, to some acceptable, optimal level.

Read more about Algorithmic Efficiency: No Automatic Process, Software Metrics, History, Speed, Memory, Transmission Size, Data Presentation, Encoding and Decoding Methods (compared and Contrasted), Effect of Programming Paradigms, Optimization Techniques, Criticism of The Current State of Programming, Managed Code, Competitions For The Best Algorithms

### Other articles related to "algorithmic efficiency, efficiency":

**Algorithmic Efficiency**- Efficiency of Alternative Methods

... For comparison, the

**efficiency**of alternatives to Euclid's algorithm may be determined ... Additional

**efficiency**can be gleaned by examining only the leading digits of the two numbers a and b ...

**Algorithmic Efficiency**

... The

**efficiency**of algorithms has an impact on the amount of computer resources required for any given computing function and there are many

**efficiency**trade-offs in writing programs ...

### Famous quotes containing the word efficiency:

“Nothing comes to pass in nature, which can be set down to a flaw therein; for nature is always the same and everywhere one and the same in her *efficiency* and power of action; that is, nature’s laws and ordinances whereby all things come to pass and change from one form to another, are everywhere and always; so that there should be one and the same method of understanding the nature of all things whatsoever, namely, through nature’s universal laws and rules.”

—Baruch (Benedict)