Troy@lemmy.ca to Technology@lemmy.worldEnglish · 8 个月前Untangling Non-Linearity: How the Linked List Changed Everythingschmud.deexternal-linkmessage-square4fedilinkarrow-up173
arrow-up173external-linkUntangling Non-Linearity: How the Linked List Changed Everythingschmud.deTroy@lemmy.ca to Technology@lemmy.worldEnglish · 8 个月前message-square4fedilink
minus-squareMondayToFriday@lemmy.calinkfedilinkEnglisharrow-up11·8 个月前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.
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.