- Arrays are faster in access than a linked list for random access with index
- Array are not dynamic while a linked list is
- Array are easier to sort than a linked list
- The element of linked list can be deleted/inserted while arrays cannot
- Array occupy the same block of memory while a linked list is distributed
- Array objects are automatically created by a compiler, while linked list are not
- Arrays are sysntactically simple to read
Tuesday, July 18, 2006
Main difference between a linked list and an array
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment