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
C compiler does not verify the bounds of arrays. It is your job to do the essential work for checking boundaries wherever required. One of the most common arrays is a string tha

Postorder traversal of a binary tree struct NODE { struct NODE *left; int value;     /* can take any data type */ struct NODE *right; }; postorder(struct NODE

write an algorithm for stack using array performing the operations as insertion ,deletion , display,isempty,isfull.

implement multiple stacks in a single dimensional array. write algorithm for various stack operation for them

implement multiple stack in single dimensionl array.write algorithms for various stack operation for them

Simplifying Assumptions of wire frame representation Neglect colour - consider Intensity: For now we shall forget about colour and restrict our discussion just to the intensi

1. What is an expert system and where are they needed? 2. What are the major issues involved in building an expert system?

What is called the basic operation of an algorithm? The most significant operation of the algorithm is the operation contributing the most to the total running time is known as

Illustrate the Back Face Detection Method A single polyhedron is a convex solid, which has no external angle between faces less  than 180° and there is a simple object space me

find the grammar of regular expression of (a/?)(a/b)?