Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on How can List be faster than native arrays? (2018). Parent comment
> 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.
> 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