On modern computers, linked lists are rarely a good option for performance. The overhead of the memory allocator and the non-sequential layout (which results in CPU memory cache misses) means that dynamic arrays are surprisingly faster even for random inserts on very long lists.
this post was submitted on 27 Jan 2024
72 points (98.6% liked)
Technology
59152 readers
2297 users here now
This is a most excellent place for technology news and articles.
Our Rules
- Follow the lemmy.world rules.
- Only tech related content.
- Be excellent to each another!
- Mod approved content bots can post up to 10 articles per day.
- Threads asking for personal tech support may be deleted.
- Politics threads may be removed.
- No memes allowed as posts, OK to post as comments.
- Only approved bots from the list below, to ask if your bot can be added please contact us.
- Check for duplicates before posting, duplicates may be removed
Approved Bots
founded 1 year ago
MODERATORS
Cool article, I feel like I learned more about linked lists in a 5 minute read than over a few classes in college.
Plus, I love that it references Vera Molnar - hand executed algorithm art is not that widely known, and people always look at me as if I have two heads the first time I bring up the topic.
Interesting how much I take our way of working for granted at this point.
xosted -- thought it might be interesting. Talks about the invention of hypertext (1965!), old movie editing methods where computers didn't have the memory for it, etc.