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
In this unit, we discussed Binary Search Trees, AVL trees and B-trees. The outstanding feature of Binary Search Trees is that all of the elements of the left subtree of the root

The below figure illustrates the BOM (Bill of Materials) for product A. The MPS (Material requirements Planning) start row in the master production schedule for product A calls for

algorithm and flow chart to find weather the given numbers are positive or negative or neutral

How do you find the complexity of an algorithm?  Complexity of an algorithm is the measure of analysis of algorithm. Analyzing an algorithm means predicting the resources that

Write an algorithm to print all even numbers in descending order and draw the flowchart

Q. Explain w hat are the stacks? How can we use the stacks  to check whether an expression is correctly parentheses or not. For example (()) is well formed but (() or )()( is not w

Q. Describe the term array.  How do we represent two-dimensional arrays in memory?  Explain how we calculate the address of an element in a two dimensional array.

WRITE AN ALGORITHM TO CONVERT PARENTHIZED INFIX TO POSTFIX FORM ALSO TRACE ALG ON ((A+B)*C-(D-E)$F+G)

Enumerate about the carrier set members Ruby is written in C, so carrier set members (which is, individual symbols) are implemented as fixed-size arrays of characters (which is

Determine in brief the Painter Algorithm a) The farthest polygon, namely the rectangle PQRS, is stored first. (b) The next farthest, the quadrilateral ABCD, is superpo