Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
Freaky
on April 24, 2016
|
parent
|
context
|
favorite
| on:
Fast incremental sort
At Newzbin we used a simple partial quicksort for returning paginated results from our custom search engine - it worked really well for our needs.
It was implemented as a plain old C macro:
https://github.com/Freaky/pqsort
CyberDildonics
on April 24, 2016
[–]
Looks a lot like std::partition
Join us for
AI Startup School
this June 16-17 in San Francisco!
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
It was implemented as a plain old C macro: https://github.com/Freaky/pqsort