News for hackers. Stuff that matters.
Re:How can List be faster than native arrays? (2018) by gjstein on Sunday August 04, 2019 @10:54AM (#20606862)
From the article:

> Even though List is very fast across the board no data-structure can be the fastest at everything.

This feels like a case in which everything is sufficiently well-implemented that the No Free Lunch Theorem [1] starts to play a role.

[1] https://en.wikipedia.org/wiki/No_free_lunch_theorem

There are no comments on this comment yet.