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
1)      Why space complexity is comparatively more critical than time complexity? 2)      Determine the space complexity of Euclid Algorithm?



What is Keyed Access- Container A collection may allow its elements to be accessed by keys. For instance, maps are unstructured containers which allows their elements to be


Question 1 Write a program in 'C' to read N numbers and print them in descending order Question 2 Discuss the properties of ADT Question 3 Write a note on

Diffuse Illumination Diffuse illumination means light that comes from all directions not from one particular source. Think about the light of a grey cloudy day as compared to

Q. Using the following given inorder and preorder traversal reconstruct a binary tree Inorder sequence is D, G, B, H, E, A, F, I, C

Determine about the unreachable code assertion An unreachable code assertion is an assertion that is placed at a point in a program that shouldn't be executed under any circum

What values are automatically assigned to those array elements which are not explicitly initialized? Garbage values are automatically assigned to those array elements that