Mostly fun stuff
Project maintained by theo-pnv
Hosted on GitHub Pages — Theme by mattgraham
Definition: A chain of nodes. A node is composed by a piece of data plus a pointer to the next node.
- Space is not contiguous, therefore allowing to store big lists.
- Front insertion and deletion are O(1).
- Accessing an element is O(n).
- Compared to arrays and for an input N, linked lists use more memory (a node = the element + a pointer forward (and eventually one backward)). This is even worse for 64-bits architectures (100k elements = 6.4mb VS 1.6mb with an array).
- Accessing elements of this memory is slower because not contiguous (caching operations).