TroytoTechnology@lemmy.worldEnglish·9 months agocross-posted to: programming@beehaw.orgUntangling Non-Linearity: How the Linked List Changed Everything(schmud.de)external-linkarrow-up173arrow-down11message-square4fedilink
arrow-up172arrow-down1external-linkUntangling Non-Linearity: How the Linked List Changed Everything(schmud.de)TroytoTechnology@lemmy.worldEnglish·9 months agocross-posted to: programming@beehaw.orgmessage-square4fedilink
minus-squareMondayToFridayEnglisharrow-up11arrow-down1·9 months agolinkfedilinkOn 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.