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
Exact analysis of insertion sort: Let us assume the following pseudocode to analyse the exact runtime complexity of insertion sort. T j   is the time taken to execute the s

Illustrate Trivariate Colour Models Conventional colour models based on the tristimulus theory all contain three variables and so are called trivariate models. Let us now consi

Explain in detail the algorithmic implementation of multiple stacks.

explain the determination of interest rate in the classical system.

write a COBOL program to find the biggest of two numbers

Illustrate the Visual realism applications a)   Robot Simulations : Visualization of movement of their links and joints  and end effector movement etc. b)  CNC programs ver

Implement a linear-expected-time algorithm for selecting the k th smallest element Algorithm description 1. If |S| = 1, then k = 1 and return the element in S as the an

c++ To calculate the amount to be paid by a customer buying yummy cupcakes for his birth day party

Handout 15 COMP 264: Introduction to Computer Systems (Section 001) Spring 2013 R. I. Greenberg Computer Science Department Loyola University Water TowerCampus, Lewis Towers 524 82

Example: (Double left rotation while a new node is added into the AVL tree (RL rotation)) Figure: Double left rotation when a new node is inserted into the AVL tree A