Definition of algorithm, Data Structure & Algorithms

Definition of Algorithm

Algorithm must have the following five characteristic features:

1.      Input

2.      Output

3.      Definiteness

4.      Effectiveness

5.      Termination.

Thus, an algorithm can be described as a sequence of definite & effective instructions, which terminates along the production of correct output from the given input.

Posted Date: 4/4/2013 5:39:19 AM | Location : United States







Related Discussions:- Definition of algorithm, Assignment Help, Ask Question on Definition of algorithm, Get Answer, Expert's Help, Definition of algorithm Discussions

Write discussion on Definition of algorithm
Your posts are moderated
Related Questions
Ans. An algorithm for the quick sort is as follows: void quicksort ( int a[ ], int lower, int upper ) { int i ; if ( upper > lower ) { i = split ( a, lower, up

PART- Pest Control Program Prepare a Pest Control Program for the facility that will address the management of Rodents, Insects and Birds. Your Pest Control Program should

Create a class "box" that will contain a random integer value v such that O

Illustrate Trivariate Colour Models Conventional colour models based on the tristimulus theory all contain three variables and so are called trivariate models. Let us now consi

AVL tree An AVL tree is a binary search tree in which the height of the left and right subtree of the root vary by at most 1 and in which the left and right subtrees are again

Explain about Hidden-surface Hidden-line removal refers to wire-frame diagrams without surface rendering and polygonal surfaces with straight edges. Hidden-surface removal ref

A common person's faith is that a computer can do anything. It is far from truth. In realism computer can carry out only definite predefined instructions. The formal illustration o

What do we mean by algorithm? What are the characteristics of a good and relevant algorithm? An algorithm is "a step-by-step procedure for finishing some task'' An algorithm c

Example of pre order traversal: Reading of a book, since we do not read next chapter unless we complete all sections of previous chapter & all its sections. Figure  : Rea

When writing a code for a program that basically answers Relative Velocity questions how do you go at it? How many conditions should you go through?