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
Give the example of bubble sort algorithm For example List: - 7 4 5 3 1. 7 and 4 are compared 2. Since 4 3. The content of 7 is now stored in the variable which was h

MID SQUARE METHOD

A binary search tree (BST), which may sometimes also be named a sorted or ordered binary tree, is an edge based binary tree data structure which has the following functionalities:

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

Containers Introduction Simple abstract data types are useful for manipulating simple sets of values, such as integers or real numbers however more complex abstract data t

Loops There are 3 common ways of performing a looping function: for ... to ... next, while ... endwhile and repeat ... until The below example input 100 numbers and find

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

Suppose we have a set of N agents and a set of N tasks.Each agent can only perform exactly one task and there is a cost associated with each assignment. We would like to find out a

1.  You are required to hand in both a hard copy and an electronic copy of the written report on the project described in A, including all the diagrams you have drawn.  2.  You

Q. Which sorting algorithm can be easily adaptable for singly linked lists? Explain your answer as well.        Ans: The simple Insertion sort is sim