properties and characteristics of algorithm
1.FINITE
An algorithm execution must stop after a finite step of action.A countable number of logical steps would lead to the solution of a problem or would help to manifest that a problem has no solution
2.DEFINITE
All steps in an algorithm must be clearly stated and well defined if possible in mathematical term.
3.EFFECTIVE
To guarantee that the step of an algorithm can actually be performed the action specify must be simple enough.
4.INPUT AND OUTPUT
An algorithm must have zero or more input data one or more output result
DEVELOPING THE ALGORITHM
1.List out the statement of the problem to be solved with available input data.
2.ensure that the input data and desired results are clearly specified.
3.identify all the major sub-program-me that must be solve in the solution process
4.list all the action that must be computed for each problem in order to solve
Comments
Post a Comment