Re:In Defense of Linked Lists
by wtetzner on Saturday November 05, 2022 @12:24AM
(#33477948)
They’re also useful when you want to cheaply reorder nodes without copying the elements.
[ Parent
| on HN ]
True. You could implement that using an array of structs where each struct contains indexes of the array to link other structures. instead of memory pointers, since they are 8 bytes in 64-bit applications. This way you get the nice properties of both linked lists and continuously allocated arrays