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
#2 example of recursion

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

Now, consider a function that calculates partial sum of an integer n. int psum(int n) { int i, partial_sum; partial_sum = 0;                                           /* L

Polynomials like  5x 4    +  2x 3    +  7x 2     +  10x  -  8  can  be  represented by using arrays. Arithmetic operations such as addition & multiplication of polynomials are com

You are given two jugs, a 4-gallon one and a 3-gallon one. Neither has any measuring marker on it. There is a tap that can be used to fill the jugs with water. How can you get exac

Define the Carrier set of the Symbol ADT Carrier set of the Symbol ADT is the set of all finite sequences of characters over Unicode characters set (Unicode is a standard char

What are the properties of an algorithsm?

Let us assume a file of 5 records that means n = 5 And k is a sorted array of keys of those 5 records. Let key = 55, low = 0, high = 4 Iteration 1: mid = (0+4)/2 = 2

Do you have a library solution for this problem?

Q. Write down an algorithm to sort a given list by making use of Quick sort method. Describe the behaviour of Quick sort when input given to us is already sorted.