Computational complexity, Data Structure & Algorithms

Generally, Computational complexity of algorithms are referred to through space complexity (space needed for running program) and time complexity (time needed for running the program). In computer of science, the concept of runtime complexity has been studied vigorously.  Sufficient research is being carried out to determine more efficient algorithms for present problems. We studied several asymptotic notations, to define the time complexity and space complexity of algorithms, say the big-O, Omega & Theta notations.  These asymptotic orders of time & space complexity define how best or worst an algorithm is for an adequately large input.

We studied regarding the process of calculation of runtime complexity of several algorithms. The exact analysis of insertion sort was discussed to define the best case, worst case & average case scenario.

Posted Date: 4/4/2013 6:22:15 AM | Location : United States







Related Discussions:- Computational complexity, Assignment Help, Ask Question on Computational complexity, Get Answer, Expert's Help, Computational complexity Discussions

Write discussion on Computational complexity
Your posts are moderated
Related Questions
multilist representation of graph

Simulation is the process of making an abstract model of a real world situation in order to be aware of the effect of modifications and alterations and the effect of introducing nu

A queue is a, FIFO (First In First Out) list.

solve the following relation by recursive method: T(n)=2T(n^1/2)+log n

Explain the halting problem Given a computer program and an input to it, verify whether the program will halt on that input or continue working indefinitely on it.

explain two strategies to implement state charts with the help of an example of each.

This unit dealt along with the methods of physically storing data in the files. The terms fields, records & files were described. The organization types were introduced. The sev

What is a height balanced tree? Height Balanced Tree (AVL Tree) An AVL tree is a binary search tree in which the height of the left and right subtree of the root vary by at most

Data records are stored in some particular sequence e.g., order of arrival value of key field etc. Records of sequential file cannot be randomly accessed i.e., to access the n th

The disadvantages or limitations of the last in first out costing method are: The election of last in first out for income tax purposes is binding for all subsequent yea