<P> 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 . </P> <P> 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 . </P> <Dl> <Dd> 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' . </Dd> </Dl>

What are the parameters to judge the efficiency of an algorithm