Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Ask HN: What is your favorite CS paper?. Parent comment
Since AP CompSci in HS it's been hammered into students that any sort based on comparisons has a strict lower bound of O(n*log n).
And sorting is particularly important in search engines, of which I've been working on.
So, an algorithm that drastically improves the speed of sorting would actually open up a few more possibilities to consider.
Thanks for sharing the paper KirinDave, I plan to read it.
There are no comments on this comment yet.
Since AP CompSci in HS it's been hammered into students that any sort based on comparisons has a strict lower bound of O(n*log n).
And sorting is particularly important in search engines, of which I've been working on.
So, an algorithm that drastically improves the speed of sorting would actually open up a few more possibilities to consider.
Thanks for sharing the paper KirinDave, I plan to read it.