Relation of time and space complexities of an algorithm, Data Structure & Algorithms

What is complexity of an algorithm? What is the basic relation between the time and space complexities of an algorithm? Justify your answer by giving an example.                         

Complexity of an algorithm is the measure of analysis of the algorithm. Analyzing an Algorithm means predicting the resources that the algorithm needs such as memory, communication bandwidth, time and logic gates. Most often it is computational or calculation time that is measured for finding a more suitable algorithm. This is called as time complexity of the algorithm.  The running time of a program is described or defined as a function of the size of its  input. On a specific input, it is traditionally measured as the number of primitive operations or steps executed.

The analysis of algorithm focuses on time complexity and space complexity both. As compared to time analysis, the analysis of space requirement for an algorithm is generally easier and faster, but wherever necessary, both the techniques can be used. The space is referred to as storage needed in addition to the space required storing the input data.  The amount of memory needed by the program to run to completion is referred to as space complexity. For an algorithm, time complexity depends only upon the size of the input, thus, it is a function of input size 'n'. So the amount of time required by an algorithm to run to its completion is referred as time complexity.

The best algorithm to solve a given problem is the one that requires less memory and takes less time to complete its execution of the algorithm. But in practice it is not always likely to achieve both of these objectives. There may be number of approaches to solve a same problem. One such approach may require more space but takes less time to complete its execution while on other hand the other approach requires less space but

more time to complete its execution. Thus we may have to compromise one thing to improve the other. That is, we may be able to reduce space requirement by increasing running time or we can reduce running time by allocating more memory space. This situation where we compromise one to improve the other is known as Time-space trade off.

 

Posted Date: 7/9/2012 9:50:02 PM | Location : United States







Related Discussions:- Relation of time and space complexities of an algorithm, Assignment Help, Ask Question on Relation of time and space complexities of an algorithm, Get Answer, Expert's Help, Relation of time and space complexities of an algorithm Discussions

Write discussion on Relation of time and space complexities of an algorithm
Your posts are moderated
Related Questions
hello, i need help in data mining assignment using sas em and crisp-dm

what are grounded header linked lists?

Write an algorithm using pseudocode which takes temperatures input over a 100 day period (once per day) and output the number of days when the temperature was below 20C and the num

Prim's algorithm employs the concept of sets. Rather than processing the graph by sorted order of edges, this algorithm processes the edges within the graph randomly by building up

The time needed to delete a node x from a doubly linked list having n nodes is O (1)

Define Strictly Binary Tree Strictly Binary Tree: - If each non leaf node in binary tree has non empty left and right sub-trees , then the tree is known as a strictly binary t


What do you mean by complexity of an algorithm? The complexity of an algorithm M is the function f(n) which gives the running time and/or storage space need of the algorithm i

difference between recursion and iteration

State the ways to construct container taxonomy There are several ways that we could construct our container taxonomy from here; one way that works well is to make a fundamental