Advantage of list over arrays, Data Structure & Algorithms

The advantage of list over Arrays is flexibility. Over flood is not a problem until the computer memory is bushed. When the individual record are quite large, it may be difficult to determine the amount of next storage that may be in need for the required arrays. With dynamic allocation, there is no need to effort to allot in advance. Changes in list, placing and deletion can be made in the central point of the list, more speedily than in the nearby lists.

The drawback of lists is that the link themselves take room which is in count to the space that may be wanted for data. One more disadvantage of lists is that they are not right for random access. With lists, we need to go across a long path to reach a desired node.

Posted Date: 4/11/2013 3:10:02 AM | Location : United States

Related Discussions:- Advantage of list over arrays, Assignment Help, Ask Question on Advantage of list over arrays, Get Answer, Expert's Help, Advantage of list over arrays Discussions

Write discussion on Advantage of list over arrays
Your posts are moderated
Related Questions
Program segment for the deletion of any element from the queue delmq(i)  /* Delete any element from queue i */ { int i,x; if ( front[i] == rear[i]) printf("Queue is

Define Merge Sort  Merge sort is a perfect example of a successful application of the divide and conquer method. It sorts a given array A[0...n-l] by separating it into two ha

Following are some of the drawback of sequential file organisation: Updates are not simply accommodated. By definition, random access is impossible. All records should be

In order to analyze an algorithm is to find out the amount of resources (like time & storage) that are utilized to execute. Mostly algorithms are designed to work along with inputs

write an algorithm to delete an element x from binary search with time complex

Write a recursive function the computes the number of digits in a positive integer n. For example if n = 6598, the function should return 4. Find a variant expression and a thresho

Determine the types of JAVA Java has two parts... 1. Core language -- variables, arrays, objects o Java Virtual Machine (JVM) runs the core language o Core language is

Q. Explain that how do we implement two stacks in one array A[1..n] in such a way that neither the stack overflows unless the total number of elements in both stacks together is n.

Q. Explain w hat are the stacks? How can we use the stacks  to check whether an expression is correctly parentheses or not. For example (()) is well formed but (() or )()( is not w

extra key inserted at end of array is called