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
Explain the concept of hidden lines The problem of hidden lines or surfaces was implicit even in 2-D graphics, but we did not mention it there, because what was intended to be

According to this, key value is divided by any fitting number, generally a prime number, and the division of remainder is utilized as the address for the record. The choice of s

explain quick sort algorithm

Linked lists are among the most common and easiest data structures. They may be used to implement various other common abstract data types, including queues, stacks, symbolic expre

Program segment for deletion of any element from the queue delete() { int delvalue = 0; if (front == NULL) printf("Queue Empty"); { delvalue = front->value;

Which data structure is required to change infix notation to postfix notation?    Stack function is used to change infix notation to postfix notatio n

what is far and near procedures in system programming?

what are the disadvantages of sparse matrix?

The  total  of  time  needed  by  an algorithm to run to its completion is termed as time complexity. The asymptotic running time of an algorithm is given in terms of functions. Th

Typical programming languages such as Pascal, C or Java give primitive data kinds such as integers, boolean, reals values and strings. They give these to be organised into arrays,