Which implementation of List should you choose for your application.

Inside Java is a resource for Java developers, offering insights, tutorials, and updates on the Java programming language, platform, and ecosystem. With contributions from Java experts and members of the Java community, Inside Java covers a wide range of topics, including language features, performance optimizations, and upcoming releases. Developers can stay informed about the latest developments in the Java ecosystem, learn about new APIs and frameworks, and explore best practices for building robust and scalable Java applications.

Inside Java

This post compares the use cases, performance, and memory consumption of ArrayList and LinkedList implementations in Java. It outlines algorithm complexities for common operations such as reading, inserting, and iterating over elements. The article provides benchmarks for different list operations and explains how elements' access times can be impacted by pointer chasing and cache misses. The situational advantages of each implementation are discussed, including memory usage considerations and specific scenarios where LinkedList may outperform ArrayList.

Choosing the Right Implementation Between ArrayList and LinkedList

Comparing the Insertion for LinkedList and ArrayList

Analyzing the Memory Consumption of LinkedList and ArrayList

I don’t remember when I ever needed to really use a LinkedList. In almost all cases, an ArrayList or other solutions performs better. Even the typical use cases for LinkedLists can in most cases be solved in a more performant way using other classes than LinkedList:
<ul>
<li>
when building a list by repeatedly inserting at the front, use an ArrayList and insert at the end, then reverse it (in Java 21+, we have reversed, otherwise a Stream can be used). Or better yet, directly use a stream.
</li>
<li>
when repeatedly adding to front and end, there is ArrayDeque.
</li>
<li>
when repeatedly inserting elements at arbitrary positions, this often means elements are ordered by some criteria, and a bulk add and then sort() can be used as determining the insert position in the LinkedList already has O(n) complexity.
</li>
<li>
if the collection does not need to be sequenced, another collection class might be more suitable, for example a SortedSet if duplicates are not allowed.
</li>
</ul>
When in doubt (and performance is paramount), use jmh to benchmark LinkedList against other implementations.
As said above: while LinkedList has its use cases, in the last at least 5 years I did not have a single case where LinkedList was the best choice.