Tradeoff between space and time complexity, Data Structure & Algorithms

We might sometimes seek a tradeoff among space & time complexity. For instance, we may have to select a data structure which requires a lot of storage to reduce the computation time. Thus, the programmer has to make a judicious choice from an informed point of view. The programmer have to have some verifiable basis based on which a data structure or algorithm can be selected Complexity analysis provides such a basis.

We will learn regarding various techniques to bind the complexity function. Actually, our goal is not to count the exact number of steps of a program or the exact amount of time needed for executing an algorithm. In theoretical analysis of algorithms, this is common to estimate their complexity in asymptotic sense that means to estimate the complexity function for reasonably large length of input 'n'. Omega notation ?, big O notation, and theta notation Θ are utilized for this purpose. To measure the performance of an algorithm underlying the computer program, our approach would be depending on a concept called as asymptotic measure of complexity of algorithm. There are notations such as big O, Θ, ? for asymptotic measure of growth functions of algorithms. The most common is big-O notation. The asymptotic analysis of algorithms is frequently used since time taken to execute an algorithm varies along with the input 'n' and other factors that might differ from computer to computer and from run to run. The essences of these asymptotic notations are to bind the growth function of time complexity along with a function for sufficiently large input.

Posted Date: 4/4/2013 5:40:47 AM | Location : United States







Related Discussions:- Tradeoff between space and time complexity, Assignment Help, Ask Question on Tradeoff between space and time complexity, Get Answer, Expert's Help, Tradeoff between space and time complexity Discussions

Write discussion on Tradeoff between space and time complexity
Your posts are moderated
Related Questions
Taking a suitable example explains how a general tree can be shown as a Binary Tree. Conversion of general trees to binary trees: A general tree can be changed into an equiv

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[

what is the impoartance of average case analysis of algorithm

Q. Define the sparse metrics and also explain the representation of a 4X4 matrix using linked list.         Ans: A matrix in which number of zero entries is quite h

Post order traversal: The children of node are visited before the node itself; the root is visited last. Each node is visited after its descendents are visited. Algorithm fo

Write the algorithm for compound interest

merging 4 sorted files containing 50 10 25 and 15 records will take time

A graph G might be defined as a finite set V of vertices & a set E of edges (pair of connected vertices). The notation utilized is as follows: Graph G = (V, E) Consider the g

Abstract data type The thing which makes an abstract data type abstract is that its carrier set and its operations are mathematical entities, like geometric objects or numbers;

Materials consumed are priced in a systematic and realistic manner. It is argued that current acquisition costs are incurred for the purpose of meeting current production and sales