Tuesday, 7 November 2017

What is the meaning of an Algorithm?  

An algorithm is a finite sequence of instructions, each of which has a clear meaning and can be performed with a finite amount of effort in a finite length of time. No matter what the input values may be, an algorithm terminates after executing a finite number of instructions. 

In addition every algorithm must satisfy the following criteria:

Input: In every algorithm, there are zero or more quantities as input, which are externally supplied by the user.
Output: In every algorithm, at least one quantity is produced as there output. 
Definiteness: In every algorithm, each instruction must have a clear and unambiguous meaning.
Finiteness: In every algorithm, if we trace out any instructions, then for every cases it will terminate after a finite steps.
Effectiveness: In every algorithm, instruction must be so basic that it can be understood by a person using only pencil and paper. 

In computer science, the difference between an algorithm and program is, program don't necessarily satisfy the fourth condition. One important example of such a program for a computer is its operating system, which never terminates but continues in a wait loop until more jobs are entered. We represent an algorithm using pseudo language that is a combination of the constructs of a programming language together with informal English. 

Mukesh Rajput

No comments:

Post a Comment

Mukesh Rajput