When to use LinkedList over ArrayList?
I've always been one to simply use:
List<String> names = new ArrayList<String>();
I use the interface as the type name for portability, so that when I ask questions such as these I can rework my code.
When should LinkedList
be used over ArrayList
and viceversa?
arraylist
Collections
Java
linkedlist
 asked 2 years ago
 B Butts
2Answer
TL;DR ArrayList
with ArrayDeque
are preferable in much more usecases, than LinkedList
. Not sure — just start with ArrayList
.
LinkedList and ArrayList are two different implementations of the List interface. LinkedList implements it with a doublylinked list. ArrayList implements it with a dynamically resizing array.
As with standard linked list and array operations, the various methods will have different algorithmic runtimes.
For LinkedList<E>
get(int index)
is O(n)add(E element)
is O(1)add(int index, E element)
is O(n)remove(int index)
is O(n)Iterator.remove()
is O(1) < main benefit ofLinkedList<E>
ListIterator.add(E element)
is O(1) < main benefit ofLinkedList<E>
For ArrayList<E>
get(int index)
is O(1) < main benefit ofArrayList<E>
add(E element)
is O(1) amortized, but O(n) worstcase since the array must be resized and copiedadd(int index, E element)
is O(n  index) amortized, but O(n) worstcase (as above)remove(int index)
is O(n  index) (i.e. removing last is O(1))Iterator.remove()
is O(n  index)ListIterator.add(E element)
is O(n  index)
LinkedList<E>
allows for constanttime insertions or removals using iterators, but only sequential access of elements. In other words, you can walk the list forwards or backwards, but finding a position in the list takes time proportional to the size of the list.
ArrayList<E>
, on the other hand, allow fast random read access, so you can grab any element in constant time. But adding or removing from anywhere but the end requires shifting all the latter elements over, either to make an opening or fill the gap. Also, if you add more elements than the capacity of the underlying array, a new array (1.5 times the size) is allocated, and the old array is copied to the new one, so adding to an ArrayList is O(n) in the worst case but constant on average.
So depending on the operations you intend to do, you should choose the implementations accordingly. Iterating over either kind of List is practically equally cheap. (Iterating over an ArrayList
is technically faster, but unless you're doing something really performancesensitive, you shouldn't worry about this  they're both constants.)
The main benefits of using a LinkedList
arise when you reuse existing iterators to insert and remove elements. These operations can then be done in O(1) by changing the list locally only. In an array list, the remainder of the array needs to be moved (i.e. copied). On the other side, seeking in a LinkedList
means following the links in O(n), whereas in an ArrayList
the desired position can be computed mathematically and accessed in O(1).
Also, if you have large lists, keep in mind that memory usage is also different. Each element of a LinkedList has more overhead since pointers to the next and previous elements are also stored. ArrayLists don't have this overhead. However, ArrayLists take up as much memory as is allocated for the capacity, regardless of whether elements have actually been added.
The default initial capacity of an ArrayList is pretty small (10 from Java 1.4  1.7). But since the underlying implementation is an array, the array must be resized if you add a lot of elements. To avoid the high cost of resizing when you know you're going to add a lot of elements, construct the ArrayList with a higher initial capacity.
It's worth noting that Vector also implements the List interface and is almost identical to ArrayList. The difference is that Vector is synchronized, so it is threadsafe. Because of this, it is also slightly slower than ArrayList. So as far as I understand, most Java programmers avoid Vector in favor of ArrayList since they will probably synchronize explicitly anyway if they care about that.
 answered 2 years ago
 Sunny Solu
Thus far, nobody seems to have addressed the memory footprint of each of these lists besides the general consensus that a Since references are either 32 or 64 bits (even when null) on their relative systems, I have included 4 sets of data for 32 and 64 bit Note: The sizes shown for the Note 2: (thanks BeeOnRope) As CompressedOops is default now from mid JDK6 and up, the values below for 64bit machines will basically match their 32bit counterparts, unless of course you specifically turn it off. Since I've had a couple of requests for it now, this image is officially public domain. Enjoy! The result clearly shows that The formulas I used follow, let me know if I have done anything wrong and I will fix it up. 'b' is either 4 or 8 for 32 or 64 bit systems, and 'n' is the number of elements. Note the reason for the mods is because all objects in java will take up a multiple of 8 bytes space regardless of whether it is all used or not.

 answered 2 years ago
 Sunny Solu
Your Answer