Following are the points in favour of Linked Lists.
(1) The size of the arrays is fixed: So we must know the upper limit on the number of elements in advance. Also, generally, the allocated memory is equal to the upper limit irrespective of the usage, and in practical uses, upper limit is rarely reached.
(2) Inserting a new element in an array of elements is expensive, because room has to be created for the new elements and to create room existing elements have to shifted.
For example, suppose we maintain a sorted list of IDs in an array id.
id = [1000, 1010, 1050, 2000, 2040, …..].
And if we want to insert a new ID 1005, then to maintain the sorted order, we have to move all the elements after 1000 (excluding 1000).
Deletion is also expensive with arrays until unless some special techniques are used. For example, to delete 1010 in id, everything after 1010 has to be moved.
So Linked list provides following two advantages over arrays
1) Dynamic size
2) Ease of insertion/deletion
Linked lists have following drawbacks:
1) Random access is not allowed. We have to access elements sequentially starting from the first node. So we cannot do binary search with linked lists.
2) Extra memory space for a pointer is required with each element of the list.
3) Arrays have better cache locality that can make a pretty big difference in performance.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Linked List | Set 2 (Inserting a node)
- Linked List | Set 1 (Introduction)
- Sorted insert for circular linked list
- How to write C functions that modify head pointer of a Linked List?
- Linked List | Set 3 (Deleting a node)
- Range product queries in an array
- Goldman Sachs Internship Interview Experience (On-Campus)
- Sudo Placement[1.5] | Second Smallest in Range
- Sudo Placement[1.5] | Partition
- Print all the combinations of N elements by changing sign such that their sum is divisible by M