The answer could be 2x. Let's say you're in a 64 bit platform. Your linked list ... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

onekorg on March 28, 2020 | parent | context | favorite | on: New Grad vs. Senior Dev

The answer could be 2x. Let's say you're in a 64 bit platform. Your linked list nodes consist of a next pointer and a 64 bit integer.

If your linked list nodes are all allocated sequentially in memory then it'd only be 2x as slow as an array of 64 bit integers.

But maybe it's not fair to call sequentially allocated linked list a "trivial linked list".

koala_man on March 28, 2020 [–]

This kind of CS-based rationalization is arguably another aspect of what the article comments on. I wrote a benchmark and found the difference in this case to be 3x-3.5x.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact