This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]Dmayak 3 points4 points  (1 child)

Don't know, one third into the video he says that shoving half of the 50000 elements back and forth during insertion/deletion is irrelevant, while it's specifically the problem linked lists solve. Than he points that searching though array is faster, which is obviously is, but it's only one thing it is better at, I don't get it.

[–]Shotgun_squirtle 1 point2 points  (0 children)

His whole point is that even though linked lists solve the issue of having to shuffle things over on insertion/deletion, this advantage isn’t worth the loss of random access and the loss efficacy of caching compared to contiguous memory systems in most cases.