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
Famous quotes containing the word efficiency:
““Never hug and kiss your children! Mother love may make your children’s infancy unhappy and prevent them from pursuing a career or getting married!” That’s total hogwash, of course. But it shows on extreme example of what state-of-the-art “scientific” parenting was supposed to be in early twentieth-century America. After all, that was the heyday of efficiency experts, time-and-motion studies, and the like.”
—Lawrence Kutner (20th century)