Analysis of Algorithm

0.1 INTRODUCTION

what is Algorithm and way do we want to analyze one? Algorithm is a finite set of particular problem. It is  step by step procedure for accomplishing desired solution. the procedure of writing an Algorithm is called as designing of Algorithm.

certain constraints are desirable in all Algorithms. first the Algorithm must be formal enough a avoid the any problem. each operation should be effective an Algorithm may have zero or more input and produces one more outputs. the Algorithm should be concise and compact in order to learn more about Algorithm, we can "Analyses" it by this we wean to study the specification of the Algorithm and to draw  result about how the implementation of that Algorithm. we can analyze the Algorithm as is following way :-

~Determine the running time of a program as a function of its inputs.

~Determine the total memory space.

~Determine the total capacity of program code.

~Determine whether the program correctly computes the desired result.

~Determine the complexity of the program i.e. how to easy to read, write, understand and modify.

the following figure represent relationship between problem, algorithm, and program.

in this text, we are concerned primarily with the running time. we consider the memory space needed to execute the program.there are factors that effect the running time of a program.

the performance of computer is determined by :-

~The hardware

~memory available

~input

~output

~the programing language in which the Algorithm is specified

~the language compiler / interpreter used