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
7. String manipulation 7.a Write a C Program using following string manipulation functions a) strcpy b) strncpy c) strcmp d) strncmp e) strlen f) strcat

As we talked in class, a program with two integer variables is universal. Now, we consider a special form of four variableprograms. Let G = (V; E) be a directed graph, where V is a

Q. Explain quick sort? Sort the given array using quick sort method. 24 56 47 35 10 90 82 31

Suppose that you want to develop a program that accepts a postfix expression and asks values for variables in the expression. Then you need to calculate the answer for the expressi

Write a program that uses the radix sort to sort 1000 random digits. Print the data before and after the sort. Each sort bucket should be a linked list. At the end of the sort, the

Dequeue (a double ended queue) is an abstract data type alike to queue, where insertion and deletion of elements are allowed at both of the ends. Like a linear queue & a circular q

What is called the basic operation of an algorithm? The most significant operation of the algorithm is the operation contributing the most to the total running time is known as

What is an unreachable code assertion An unreachable code assertion can be placed at the default case; if it's every executed, then program is in an erroneous state. A loop in

What are the languages which support assertions Languages which support assertions often provide different levels of support. For instance, Java has an assert statement which t

In this unit, we have learned how the stacks are implemented using arrays and using liked list. Also, the advantages and disadvantages of using these two schemes were discussed. Fo