Characteristics of good algorithms, Data Structure & Algorithms

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 can be specified in many ways. For example, it can be written down in English (or French, or any other language). However, we are interested in algorithms which have been specifically specified using an appropriate mathematical formalism--such as a programming language.

Each and Every algorithm should have the following five characteristics:

1.Input characteristics: The algorithm should be taking zero or more input.

2. Output characteristics: The algorithm should be producing one or more outputs.

3. Definiteness characteristics: All the steps of algorithm should be defined unambiguously.

4. Effectiveness characteristics: A person should be able to calculate the values involved in the process of the algorithm using paper and pencil.

5. Termination characteristics: An algorithm must terminate after a finite number of steps which means it should not be infinite.

 

Posted Date: 7/9/2012 9:47:44 PM | Location : United States







Related Discussions:- Characteristics of good algorithms, Assignment Help, Ask Question on Characteristics of good algorithms, Get Answer, Expert's Help, Characteristics of good algorithms Discussions

Write discussion on Characteristics of good algorithms
Your posts are moderated
Related Questions
An AVL tree is a binary search tree that has the given properties: The sub-tree of each of the node differs in height through at most one. Each sub tree will be an AVL tre

Example which cause problems for some hidden-surface algorithms Some special cases, which cause problems for some hidden-surface algorithms, are penetrating faces and cyclic ov

What is a Binary Search Tree (BST)? A binary search tree B is a binary tree every node of which satisfies the three conditions: 1.  The value of the left-subtree of 'x' is le

Q. Write an algorithm that counts number of nodes in a linked list.                                       A n s . Algo rithm to Count No. of Nodes in Linked List C

Explain an efficient method of storing a sparse matrix in memory. Write a module to find the transpose of the sparse matrix stored in this way. A matrix which contains number o

Define the terms     i) Key attribute     ii) Value set  Key attribute:  An entity  type  usually  has  an attribute  whose  values  are  distinct  fr

You are given two jugs, a 4-gallon one and a 3-gallon one. Neither has any measuring marker on it. There is a tap that can be used to fill the jugs with water. How can you get exac

Q. What do you mean by the best case complexity of quick sort and outline why it is so. How would its worst case behaviour arise?

Program: Creation of a Circular linked list ALGORITHM (Insertion of an element into a Circular Linked List) Step 1        Begin Step 2      if the list is empty or new

You are given two jugs, a 4-gallon one and a 3-gallon one. Neither has any measuring marker on it. There is a tap that can be used to fill the jugs with water. How can you get exac