Welcome to Incremental Social! Learn more about this project here!
Check out lemmyverse to find more communities to join from here!

MondayToFriday ,

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.

catarina ,
@catarina@kbin.social avatar

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.

LesserAbe ,

Interesting how much I take our way of working for granted at this point.

troyunrau OP ,
@troyunrau@lemmy.ca avatar

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.

  • All
  • Subscribed
  • Moderated
  • Favorites
  • technology@lemmy.world
  • random
  • incremental_games
  • meta
  • All magazines