The space - time trade off, Data Structure & Algorithms

The best algorithm to solve a given problem is one that requires less space in

memory and takes less time to complete its execution. But in practice it is not always possible to achieve both of these objectives. There may be more than one approach to solve a problem. One approach may require more space but less time to complete its execution. The 2nd approach may require less space but takes more time to complete execution. We choose 1st approach if time is a constraint and 2nd approach if space is a constraint. Thus we may have to sacrifice one at cost of the other.  That  is  what  we  can  say that  there  exists  a  time  space  trade  among algorithm.

 

 

Posted Date: 7/12/2012 9:22:16 AM | Location : United States







Related Discussions:- The space - time trade off, Assignment Help, Ask Question on The space - time trade off, Get Answer, Expert's Help, The space - time trade off Discussions

Write discussion on The space - time trade off
Your posts are moderated
Related Questions
Describe an algorithm to play the Game of Nim using all of the three tools (pseudocode, flowchart, hierarchy chart)

Explain how two dimensional arrays are represented in memory. Representation of two-dimensional arrays in memory:- Let grades be a 2-D array as grades [3][4]. The array will

What is Efficiency of algorithm? Efficiency of an algorithm can be precisely explained and investigated with mathematical rigor.  There are two types of algorithm efficiency

Q. Can a Queue be represented by circular linked list with only one pointer pointing to the tail of the queue? Substantiate your answer using an example. A n s . Yes a

Ask consider the file name cars.text each line in the file contains information about a car ( year,company,manufacture,model name,type) 1-read the file 2-add each car which is repr

What is A Container Taxonomy It's useful to place containers in a taxonomy to help understand their relationships to one another and as a basis for implementation using a class

Demonstration of Polynomial using Linked List # include # include Struct link { Char sign; intcoef; int expo; struct link *next; }; Typedefstruct link

How sparse matrix stored in the memory of a computer?

Q. Give the algorithm for the selection sort. Describe the behaviours of selection sort when the input given is already sorted.

It offers an effective way to organize data while there is a requirement to access individual records directly. To access a record directly (or random access) a relationship is