Skip to content

Vs (Array & Linked List)

Overview

Operation Arrays Linked Lists
Storage Contiguous Memory Space Dispersed Memory Space
Capacity Expansion Fixed Length Flexible Expansion
Memory Efficiency Less Memory per Element, Potential Space Wastage More Memory per Element
Accessing Elements \(O(1)\) \(O(n)\)
Adding Elements \(O(n)\) \(O(1)\)
Deleting Elements \(O(n)\) \(O(1)\)