Name an advantage of array over linked list?
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
What is overloading in oop?
what is the drawback of classical methods in oops?
What are main features of oop?
what type of questions
What is polymorphism in oop example?
What is the difference between inheritance and polymorphism?
write knight tour problem which is present in datastructure
Can we create object of interface?
How long to learn object oriented programming?
What is oops?what is its use in software engineering?
What are classes oop?
How Do you Code Composition and Aggregation in C++ ?
Get me a number puzzle game-program
What is class and example?
Is react oop?