Algorithm Analysis

 Algorithm Analysis

• Analysis of algorithm is the determination of  the amount of time and space resources required to execute it.
• An Algorithm analysis is technique that is used to measure the performance of the algorithms.

Characteristics Of Algorithm

1. Input: An algorithm takes zero or more inputs.
2. Output: An algorithm genearates one or more outputs. at least one output.
3. Finiteness: Algorithm must be terminate after finite numbers of steps for all cases.
4. Definiteness: Each step of an algorithm must be percisely define.
5. Effectiveness: Each instruction must be sufficiently basic, then it can be done exactly and in finte time by a person using only paper and pencil.

Running Time Analysis

• It is the processing time us size of the input. The input may be of different types based on problems.
• Common inputs are:

1. Size of array.
2. Number of element in a matrix.
3. Polynomial degree.
4. Numbers of bits in binary repersentation.
5. Edges and vertices in a graph.

Performance Of Analysis:

• Space Complexity:- Deal with storage requirement .
• Time Complexity:- Deal with computing time.