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
Explain binary search with an example

Q. Give the algorithm to build a binary tree where the yields of preorder and post order traversal are given to us.

perform the following length operation LENGTH("welcome to ICA")=

important points on asymptotic notation to remember

Write an algorithm to print all even numbers in descending order and draw the flowchart

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

Q. What is the smallest value of n such that an algorithm whose running time is 100n2 runs faster than an algorithm whose running time is 2n on the same machine.    A n

A useful tool which is used for specifying the logical properties of a data type is called the abstract data type or ADT. The term "abstract data type" refers to the fundamental ma

In the last section, we discussed regarding shortest path algorithm that starts with a single source and determines shortest path to all vertices in the graph. In this section, we

Q. Define the terms data type and abstract data type. Comment upon the significance of both these.   Ans: We determine the total amount of memory to reserve by determining