BASIS FOR

ARRAY LINKED LIST

COMPARISON

Basic It is a consistent set of a It is an ordered set

fixed number of data comprising a variable

items. number of data items.

Size Specified during No need to specify; grow

declaration. and shrink during execution.

Storage Allocation Element location is Element position is assigned

allocated during compile during run time.

time.

Order of the Stored consecutively Stored randomly

elements

Accessing the Direct or randomly Sequentially accessed, i.e.,

element accessed, i.e., Specify Traverse starting from the

the array index or first node in the list by the

subscript. pointer.
 BASIS FOR
ARRAY LINKED LIST
COMPARISON

Insertion and Slow relatively as Easier, fast and efficient.

deletion of shifting is required.

element

Searching Binary search and linear linear search

search

Memory required less More

Memory Utilization Ineffective Efficient