Re:Linked List Problems (2002) [pdf]
by stochastic_monk on Saturday November 25, 2017 @03:57AM
(#15775112)
Vectors are also usually more memory-efficient, period. A singly-linked list uses a pointer for each element an a doubly-linked uses two, while a vector has constant [a pointer and two integers (size and capacity)] overhead. (Unless the vector was dynamically resized and isn't near capacity.)
[ Parent
| on HN ]
There are no comments on this comment yet.