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

Ask an Expert

Your posts are moderated

Write your message here..

Related Questions

The time and space complexities of an algorihm, Relation between the time a... Relation between the time and space complexities of an algorithm The examining of algorithm focuses on time complexity and space complexity. As compared to time analysis, the a

Sorting algorithm, Sorting Algorithm A sorting algorithm is an algorit... Sorting Algorithm A sorting algorithm is an algorithm which puts elements of a list in a certain order. The most-used orders are numerical order and lexicographical order. Eff

The smallest element of an array''s index, The smallest element of an array... The smallest element of an array's index is called its Lower bound.

Explain linked list and its types, Data Structure and Algorithm 1. Exp... Data Structure and Algorithm 1. Explain linked list and its types. How do you represent linked list in memory? 2. List and elucidate the types of binary tree. 3. Descr

Delete a given specific node from a doubly linked list. , D elete a specif... D elete a specific Node from Double Linked List as follows DELETEDBL(INFO, FORW, BACK, START, AVAIL,LOC) 1. [Delete Node] Set FORW [ BACK [LOC]]:= FORW[LOC]& BACK [FORW[

Explain how the shuttle sort algorithm works, Question 1 Explain how th... Question 1 Explain how the shuttle sort algorithm works by making use of the following list of integers:11, 4, 2, 8, 5, 33, 7, 3, 1, 6. Show all the steps. Question 2

Explain first - fit method, First - Fit Method: -    The free list is trave... First - Fit Method: -    The free list is traversed sequentially to search the 1st free block whose size is larger than or equal to the amount requested. Once the block is found it

Postfix expression, : Write an algorithm to evaluate a postfix expression. ... : Write an algorithm to evaluate a postfix expression. Execute your algorithm using the following postfix expression as your input: a b + c d +*f ­ .

Generic doubly linked list, Your objective is to write a generic doubly lin... Your objective is to write a generic doubly linked list class called CS228LinkedList that implements the List interface and uses a type variable T. All methods except for subList a

Define heap, HEAP  A heap is described to be a binary tree with a key i... HEAP  A heap is described to be a binary tree with a key in every node, such that  1-All the leaves of the tree are on 2 adjacent levels. 2- All leaves on the lowest leve