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
The following DNA sequences are extracted from promoter region of genes which are co-regulated by the same transcription factor (TF). The nucleotide segments capitalized in the giv

representation of links list in memory

#What is the pointer

Q. Write down an algorithm to convert an infix expression into the postfix expression.     Ans. Algo rithm to convert infix expression to post fix expression is given as

Which sorting algorithms does not have a worst case running time of  O (n 2 ) ? Merge sort

whate is meant by the term heuristic

How sparse matrix stored in the memory of a computer?

Define Big Theta notation Big Theta notation (θ) : The upper and lower bound for the function 'f' is given by the big oh notation (θ). Considering 'g' to be a function from t

There are three kinds of tree traversals, namely, Postorder , Preorder and Inorder. Preorder traversal: Each of nodes is visited before its children are visited; first the roo