Top 6.5% on proxy.golang.org
proxy.golang.org : github.com/tsenart/quickselect
The quickselect package provides primitives for finding the smallest k elements in slices and user-defined collections. The primitives used in the package are modeled off of the standard sort library for Go. Quickselect uses Hoare's Selection Algorithm which finds the smallest k elements in expected O(n) time, and is thus an asymptotically optimal algorithm (and is faster than sorting or heap implementations).
Registry
-
Source
- Documentation
- JSON
purl: pkg:golang/github.com/tsenart/quickselect
License: MIT
Latest release: 24 days ago
Namespace: github.com/tsenart
Last synced: 24 days ago