Complexity, Data Structure & Algorithms

Complexity: How do the resource needs of a program or algorithm scale (the growth of resource requirements as a function of input). In other words, what happens with the performance of an algorithm, as the size of the difficulty being solved gets larger & larger? For instance, the time & memory requirement of an algorithm that computes the sum of 1000 numbers is larger than the algorithm that computes the sum of 2 numbers.

Time Complexity: The maximum time needed through a Turing machine to execute on any input of length n.

Space Complexity: The amount of storage space needed by an algorithm varies along the size of the problem being solved out. Normally the space complexity is expressed as an order of magnitude of the size of the problem, for example (n2) means that if the size of the problem (n) doubles then the working storage (memory) needs will become four times.

Posted Date: 4/4/2013 5:47:56 AM | Location : United States







Related Discussions:- Complexity, Assignment Help, Ask Question on Complexity, Get Answer, Expert's Help, Complexity Discussions

Write discussion on Complexity
Your posts are moderated
Related Questions
1. Define the following terms in a rule-based expert system? a) Knowledge base b) Inference engine 2. What is a fuzzy rule? Explain the difference between classical and fuzzy

The best algorithm to solve a given problem is one that requires less space in memory and takes less time to complete its execution. But in practice it is not always possible to

Q. Explain the insertion sort with a proper algorithm. What is the complication of insertion sort in the worst case?

What is an algorithm?  What are the characteristics of a good algorithm? An algorithm is "a step-by-step process for accomplishing some task'' An algorithm can be given in many

3. A function to convert a complex number in algebraic form to a complex number in phasor form


Q. Write an algorithm that counts number of nodes in a linked list.                                       A n s . Algo rithm to Count No. of Nodes in Linked List C

A LGORITHM (Deletion of an element from the linked list) Step 1  Begin Step 2  if the list is empty, then element cannot be deleted Step 3  else, if the element to be del

The process of accessing data stored in a serial access memory is same to manipulating data on a By using stack  method.

Example of Back Face Detection Method To illustrate the method, we shall start with the tetrahedron (pyramid) PQRS of     Figure with vertices P (1, 1, 2), Q (3, 2, 3), R (1,