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
explain the determination of interest rate in the classical system.

It does not have any cycles (circuits, or closed paths), which would imply the existence of more than one path among two nodes. It is the most general kind of tree, and might be co

what happen''s in my computer when i input any passage

Graph Traversal In many problems we wish to investigate all the vertices in a graph in some systematic order. In graph we often do not have any single vertex singled out as spe

The Euclidean algorithm is an algorithm to decide the greatest common divisor of two positive integers. The greatest common divisor of N and M, in short GCD(M,N), is the largest in


circular queue using c

Representation of Linked list in Memory:- Each node has an info part and a pointer to the next node also known as link. The number of pointers is two in case of doubly linked

Binary search tree. A binary search tree is a binary tree that is either empty or in which every node having a key that satisfies the following conditions: - All keys (if an

state difference between linear and non linear data structure. give one example scenario of each