answersLogoWhite

0

I assume you are referring to implementation of Abstract Data Types like Stacks and Queues.

Arrays have capacity limits which you set upon declaring them. If you have date which has a definite size, then using arrays is okay.

But if you have data which size changes at runtime, then just use linked lists because linked lists could constantly add nodes whenever needed.

arrays need continuous memory allocation for their creation but in linked list the memory allocation need not be continuous....

User Avatar

Wiki User

14y ago

What else can I help you with?

Related Questions

What is the difference between dynamic implementation and linked list implemention?

The size or length of the list. For static, the size is a constant, while the size of a dynamic list may change over time. The 7 weekdays is static (in size/length, though the content is static as well), while the questions and answers at answers.com are 2 dynamic lists (the sizes are not constants, although just growing)


What are the differentiate between dynamic linking and dynamic loading?

Dynamic linking defers of the linking process until a program running or sometimes. It provides a variety of benefits that are hard to get otherwise- a. Dynamically linked shared libraries are easier to create that statically linked shared libraries. b. Dynamically linked shared libraries are easir to update than statically linked shared libraries.


When a direct comparison between two things unlike one another but considered essentially linked in some way?

metaphore


What is direct comparison between two things unlike one another but considered essentially linked in some way?

=This is called a Metaphor.=


What time required to insert element in stack with linked implementation?

O(1)


What is the difference between linked list and Ordinary list?

A list is an abstract data structure, usually defined as an ordered collection of data. A linked list refers to a specific implementation of a list in which each element in the list is connected (linked) to the next element.


Where linked list using?

linked list are used for creation of stack,queues to use memory in optimum manner linked list are used as they are dynamic in nature


What is a direct comparison between two things unlike one another but considered essentially linked in some way?

=This is called a Metaphor.=


What is a direct comparison between two things unlike one another but comsidered essentially linked in some way?

metaphor f**k apex


What Linked list uses.type of memory allocation?

Linked lists use dynamic memory allocation (also called "heap memory allocation", as the linked list is stored in heap memory).


How do you write a C plus plus program which involves polynomial addition and subtraction?

Polynomial addition and subtraction is a relatively straightforward process. You add or subtract coefficients of like order. This is a perfect example of a linked list, where the head of the list is order 0, the next element is order 1, and so on and so forth. Each element only needs one data item - the numeric coefficient. In C, you could do this as an ordinary linked list, or as an array, perhaps of dynamic size. In C++, you could create a polynomial class with operators to add and subtract, leaving the implementation details inside - it would no longer matter if it were a linked list, a dynamic array, or whatever. That is the beauty of encapsulation.


Implementation of queue?

Queues are commonly implemented for abstract routines and data access structures. In languages using object-orientation, they may be featured as classes. Some methods for implementation include circular buffers and linked tests.