Name an advantage of array over linked list?
- 24 Answers
- 57381 Views
- GML, IBM, Software Solutions, I also Faced
- E-Mail Answers
Answer Posted / sumeet choudhury
Arrays have random access and less overheads compared to
Linked list have sequential access only with too much
overheads and no cache memory support.
On the other hand, arrays allow random access, while linked
lists allow only sequential access to elements. Singly-
linked lists, in fact, can only be traversed in one
direction. This makes linked lists unsuitable for
applications where it's useful to look up an element by its
index quickly, such as heapsort. Sequential access on
arrays is also faster than on linked lists on many machines
due to locality of reference and data caches. Linked lists
receive almost no benefit from the cache.
Another disadvantage of linked lists is the extra storage
needed for references, which often makes them impractical
for lists of small data items such as characters or boolean
values. It can also be slow, and with a naïve allocator,
wasteful, to allocate memory separately for each new
element, a problem generally solved using memory pools.
| Is This Answer Correct ? | 64 Yes | 10 No |
Post New Answer View All Answers
Can a destructor be called directly?
What is methods in oop?
What is polymorphism oop?
How Do you Code Composition and Aggregation in C++ ?
What does enum stand for?
class type to basic type conversion
What are the 4 pillars of oop?
Why do we use oops?
What are different oops concepts?
What is difference between oop and pop?
IS IT NECESSARY TO INITIALIZE VARIABLE? WHAT IF THE INSTANCE VARIABLE IS DECLARED final ? IS IT NECESSARY TO INITIALIZE THE final VARIABLE AT THE TIME OF THEIR DECLARATION?
Why polymorphism is used in oops?
What is abstraction encapsulation?
Can private class be inherited?
What is overloading in oop?
