Kth: High-Performance Selection Algorithms for Go

[brodouevencode]

Request: version the library so it's a little easier to manage.

[tsenart]

Author here! Will do eventually.

[nnx]

This looks interesting but I can't think of an use case. Can you share some examples where it could be useful?

[tsenart]

Yes! A typical use case is to efficiently implement ORDER BY LIMIT N in SQL databases in a way that doesn’t require sorting the entire column just to get those first N items.