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

Channel access In first generation systems, every cell supports a number of channels. At any given time a channel is allocated to only one user. Second generation systems also

Implement a linear-expected-time algorithm for selecting the k th smallest element Algorithm description 1. If |S| = 1, then k = 1 and return the element in S as the an

hello, i need help in data mining assignment using sas em and crisp-dm

differentiate between indexing and hashing in file organization

We have discussed already about three tree traversal methods in the earlier section on general tree. The similar three different ways to do the traversal -inorder , preorder, and p

Explain the bubble sort algorithm. Answer This algorithm is used for sorting a list. It makes use of a temporary variable for swapping. It compares two numbers at an insta

Exact analysis of insertion sort: Let us assume the following pseudocode to analyse the exact runtime complexity of insertion sort. T j   is the time taken to execute the s

Explain th term input and output-  Pseudocode Input and output indicated by the use of terms input number, print total, output total, print "result is" x and so on.

Q. What do you understand by the term Binary Tree? What is the maximum number of nodes which are possible in a Binary Tree of depth d. Explain the terms given below with respect to