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
Determine the Components of Illumination The light reaching the eye when looking at a surface has clearly come from a source (or sources) of illumination and bounced off the su

Algorithm to Delete a given node from a doubly linked list Delete a Node from Double Linked List DELETEDBL(INFO, FORW, BACK, START, AVAIL,LOC) 1. [Delete Node] Set FOR

Q. Describe the term hashing. Explain any two usually used hash functions. Explain one method of collision resolution.

Since the stack is list of elements, the queue is also a list of elements. The stack & the queue differ just in the position where the elements may be added or deleted. Similar to

data structure for multiqueue

Write a program to create a heap file that holds the records in the file " data_2013 " The source records are variablelength.However, the heap file should hold fixed-length reco

In the earlier unit, we have discussed about the arrays. Arrays are data structures of fixed size. Insertion & deletion involves reshuffling of array elements. Thus, arraymanipulat

In this section, we will discuss about Sequential file organization. Sequential files have data records stored in a particular sequence. A sequentially organized file might be stor

for(int i = 0; i for (int j = n - 1; j >= i ; j--){ System.out.println(i+ " " + j);

Write an algorithm for binary search. What are its limitations? .