ArrayList and LinkedList are two popular concrete implementations of List interface from Java's popular Collection framework. Being List implementation both ArrayList and LinkedList are ordered, the index based and allows duplicate. Despite being from same type hierarchy there are a lot of differences between these two classes which makes them popular among Java interviewers. The main difference between ArrayList vs LinkedList is that former is backed by an array while later is based upon linked list data structure, which makes the performance of add(), remove(), contains() and iterator() different for both ArrayList and LinkedList. The difference between ArrayList and LinkedList is also an important Java collection interview questions, as much popular as Vector vs ArrayList or HashMap vs HashSet in Java. Sometimes this is also asked as When to use LinkedList and When to use ArrayList in Java. In this Java collection tutorial, we will compare LinkedList vs ArrayList on the various parameter which will help us to decide when to use ArrayList over LinkedList in Java.
When to use ArrayList vs LinkdedList
Before comparing differences of ArrayList and LinkedList, let's see What is common between ArrayList and LinkedList in Java :
1) Both ArrayList and LinkedList are an implementation of List interface, which means you can pass either ArrayList or LinkedList if a method accepts List interface.
2) Both ArrayList and LinkedList are not synchronized, which means you can not share them between multiple threads without external synchronization. See here to know How to make ArrayList synchronized in Java.
3) ArrayList and LinkedList are ordered collection e.g. they maintain insertion order of elements i.e. first element will be added to the first position.
4) ArrayList and LinkedList also allow duplicates and null unlike any other List implementation e.g. Vector.
5) Iterator of both LinkedList and ArrayList are fail-fast which means they will throw ConcurrentModificationException if a collection is modified structurally once Iterator is created. They are different than CopyOnWriteArrayList whose Iterator is fail-safe.
Now let's see some difference between ArrayList and LinkedList and When to use ArrayList and LinkedList in Java.
1) Data Structure
The first difference between ArrayList and LinkedList comes with the fact that ArrayList is backed by Array while LinkedList is backed by LinkedList. This will lead further differences in performance.
2) LinkedList implements Deque
Another difference between ArrayList and LinkedList is that apart from List interface, LinkedList also implements Deque interface, which provides first in first out operations for add() and poll() and several other Deque functions. Also, LinkedList is implemented as a doubly linked list and for index based operation navigation can happen from either end.
3) Adding element in ArrayList
Adding element in ArrayList is O(1) operation if it doesn't trigger re-size of Array, in which case it becomes O(log(n)) , On the other hand appending an element in LinkedList is O(1) operation, as it doesn't require any navigation.
4) Removing element from a position
In order to remove an element from a particular index e.g. by calling remove(index), ArrayList performs a copy operation which makes it close to O(n) while LinkedList needs to traverse to that point which also makes it O(n/2), as it can traverse from either direction based upon proximity.
5) Iterating over ArrayList or LinkedList
Iteration is the O(n) operation for both LinkedList and ArrayList where n is a number of an element.
6) getting element from a position
get(index) operation is O(1) in ArrayList while its O(n/2) in LinkedList, as it needs to traverse till that entry.
LinkedList uses a wrapper object, Entry, which is a static nested class for storing data and two nodes next and previous while ArrayList just stores data in Array. So memory requirement seems less in the case of ArrayList than LinkedList except the case where Array performs the re-size operation when it copies content from one Array to another. If Array is large enough it may take a lot of memory at that point and trigger Garbage collection, which can slow response time.
From all the above differences between ArrayList vs LinkedList, It looks ArrayList is the better choice than LinkedList in almost all cases, except when you do a frequent add() operation than remove() or get(). In my opinion, use ArrayList over LinkedList for most of the practical purpose.
Other Java Collection articles from Java67 blog