Java Tech Enthusiast

Nov 6, 2026 · Fundamentals

Linked Lists Dead? Why O(1) Isn't Always Faster Than O(N) — Stroustrup & Cache Reality

This article explores why linked lists often underperform arrays in modern CPUs despite O(1) insertion complexity, examining cache locality, memory walls, and real-world benchmarks from Stroustrup and Carruth, while identifying scenarios where linked lists remain essential.