|
|
|
|
|
by yongjik
3348 days ago
|
|
Well on a 64-bit machine each node of a singly-linked list of integers will be 16 bytes (8 byte pointer + 4 byte integer + 4 byte for padding). That's 300% overhead. Becomes 500% for doubly-linked lists. So it's not surprising that linked lists perform very poorly in such circumstances. |
|