What is complexity, Data Structure & Algorithms

Complexity is the rate at which the needed storage or consumed time rise as a function of the problem size. The absolute growth based on the machine utilized to execute the program, the compiler utilized to construct the program, and several other factors. We would like to have a way of defining the inherent complexity of a program (or piece of a program), independent of machine/compiler considerations. It means that we have to not attempt to describe the absolute time or storage needed. We have to instead concentrate on a "proportionality" approach, expressing the complexity in terms of its relationship to some known function. This kind of analysis is known as asymptotic analysis. It might be noted that we are dealing with complexity of an algorithm not that of a problem. For instance, the simple problem could have high order of time complexity & vice-versa.

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







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

Write discussion on What is complexity
Your posts are moderated
Related Questions
Enumerate about the Data structure An arrangement of data in memory locations to signify values of the carrier set of an abstract data type. Realizing computational mechanis

/* The program accepts matrix like input & prints the 3-tuple representation of it*/ #include void main() { int a[5][5],rows,columns,i,j; printf("enter the order of

The below formula is used to calculate n: n = (x * x)/ (1 - x). Value x = 0 is used to stop the algorithm. Calculation is repeated using values of x until value x = 0 is input. The

What is tha flow chart of algorithm

An unsorted array is searched through linear search that scans the array elements one by one until the wanted element is found. The cause for sorting an array is that we search

algorithm for insertion in a queue using pointers

Insertion & deletion of target key requires splaying of the tree. In case of insertion, the tree is splayed to find the target. If, target key is found out, then we have a duplicat


Q. Explain the technique to calculate the address of an element in an array. A  25 × 4  matrix array DATA is stored in memory in 'row-major order'. If base  address is 200 and

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