Algorithms Analysis:

Algorithm:

An algorithm is a set of steps to accomplish as task.

An algorithm in a computer program is a set of steps applied over a set of input to produce a set of output.

Knowledge of algorithm help us to get our desired result faster by applying the right algorithm.

The most important properties of an algorithm are:

Correctness: The algorithm should be correct. It should be able to process all the given inputs and provide correct output.

Efficiency: The algorithm should be efficient in solving problems.

Algorithm complexity is defined as how fast a particular algorithm performs. Complexity is represented by function T(n)-time versus the input size n.

Asymptotic analysis:

Asymptotic analysis is used to compare the efficiency of algorithm independent of any particular data set of programming language.

We are generally interested in the order of growth of some algorithm and not interested in the exact time required for running an algorithm. This time is -also called Asymptotic- running time.