Troy@lemmy.ca to Technology@lemmy.worldEnglish · 1 year agoUntangling Non-Linearity: How the Linked List Changed Everythingschmud.deexternal-linkmessage-square4fedilinkarrow-up173arrow-down11
arrow-up172arrow-down1external-linkUntangling Non-Linearity: How the Linked List Changed Everythingschmud.deTroy@lemmy.ca to Technology@lemmy.worldEnglish · 1 year agomessage-square4fedilink
minus-squareMondayToFriday@lemmy.calinkfedilinkEnglisharrow-up11arrow-down1·1 year agoOn modern computers, linked lists are rarely a good option for performance. The overhead of the memory allocator and the non-sequential layout (which results in CPU memory cache misses) means that dynamic arrays are surprisingly faster even for random inserts on very long lists.
On modern computers, linked lists are rarely a good option for performance. The overhead of the memory allocator and the non-sequential layout (which results in CPU memory cache misses) means that dynamic arrays are surprisingly faster even for random inserts on very long lists.