Scribd
Upload
74 views

Algorithm Informal Definition

An algorithm is a well-defined computational procedure that takes input and produces output by following a finite set of unambiguous steps. It must have definiteness through clear instructions, terminate after a finite number of steps, and be effective by using basic instructions that can be executed with pencil and paper. Studying algorithms involves designing them, expressing them clearly, analyzing their time and space complexity, validating their accuracy, and testing them for errors.

Uploaded by

Kellie Lewis
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
74 views

Algorithm Informal Definition

An algorithm is a well-defined computational procedure that takes input and produces output by following a finite set of unambiguous steps. It must have definiteness through clear instructions, terminate after a finite number of steps, and be effective by using basic instructions that can be executed with pencil and paper. Studying algorithms involves designing them, expressing them clearly, analyzing their time and space complexity, validating their accuracy, and testing them for errors.

Uploaded by

Kellie Lewis
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

ALGORITHM

Informal Definition:
An Algorithm is any well-defined computational procedure that takes
some value or set of values as Input and produces a set of values or some
value as output.
Thus algorithm is a sequence of computational steps that transforms the
i/p into the o/p.
Formal Definition:
An Algorithm is a finite set of instructions that, if followed, accomplishes a
particular task. In addition, all algorithms should satisfy the following
criteria.
1. INPUT - Zero or more quantities are externally supplied.
2. OUTPUT - At least one quantity is produced.
3. DEFINITENESS - Each instruction is clear and unambiguous.
4. FINITENESS - If we trace out the instructions of an algorithm, then for
all cases, the algorithm terminates after a finite number of steps.
5. EFFECTIVENESS - Every instruction must very basic so that it can be
carriedout, in principle, by a person using only pencil & paper.
Issues or study of Algorithm:
How to device or design an algorithm ? creating and algorithm.
How to express an algorithm ? definiteness.
How to analysis an algorithm ? time and space complexity.
How to validate an algorithm ? fitness.
Testing the algorithm ? checking for error.

You might also like