Before understanding difference between Array and Link List we see the definition of both .
Definition:
An array is a pre-allocated block of memory holding an ordered bunch of items. A linked list is a data structure with no pre-allocated memory, but rather each item in the list contains the address of “adjacent” items (the next one and the previous one).
Differences:
- Arrays are linear data structures.
- Array is index-based data structure.
- Array elements can be modified easily by identifying the index value
- Array elements cannot be added, deleted once it is declared.
- The size of the array is fixed.
- Stored in contiguous Memory Locations.
- Memory Should be allocated at Compile-Time.
Linked list:
- Linked lists are linear and non-linear data structures.
- Linked lists is reference-based data structure.
- It is a complex process for modifying the node in a linked list.
- The nodes in the linked list can be added and deleted from the
list.
- Dynamic size
- Extra memory space for a pointer is required with each element of
the list.
- In Linked list memory is allocated at Run-Time.
Do you want to know more about the Basics Programming Technology
please visit the http://tccicomputercoaching.com/computer-course/
You can choose any course as per your interest at TCCI in Ahmedabad.
Call us
@ 98256 18292.
Visit us@
tccicomputercoaching 