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
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

State about the Simple types - Built-In Types Values of the carrier set are atomic, that is, they can't be divided into parts. Common illustrations of simple types are inte

Explain about greedy technique The  greedy  method  suggests  constructing  a   solution  to  an  optimization  problem   by  a sequence of steps, every expanding a partially c

How does operations like insertion, deletion occur?

Q. What do you understand by the term sparse matrix? How sparse matrix is stored in the memory of a computer? Write down the function to find out the transpose of a sparse matrix u

This question is based on the requirements of a system to record band bookings at gigs. (A 'gig' is an event at which one or more bands are booked to play). You do not need to know

Suppose we have a set of N agents and a set of N tasks.Each agent can only perform exactly one task and there is a cost associated with each assignment. We would like to find out a

a. In worst case the order of linear search is O (n/2) b. Linear search is more competent than Binary search. c. For Binary search, the array must be sorted in ascending orde

A queue is a, FIFO (First In First Out) list.

Polynomials like  5x 4    +  2x 3    +  7x 2     +  10x  -  8  can  be  represented by using arrays. Arithmetic operations such as addition & multiplication of polynomials are com