Q. Explain how you will analyse the efficiency of an algorithm.

Ans.In computer science,

Ans.In computer science,

**algorithmic efficiency**is a property of an algorithm which relates to the amount 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 measure of performance.

*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’.-
The importance of efficiency with respect to time was emphasised by Ada Lovelace in 1843 as applying to Charles Babbage‘s mechanical analytical engine: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: