Lib.rs

› Algorithms
#sorting #primary-key #algorithm #counting #scenario #combining #bin

i_key_sort

A fast sorting algorithm combining bin and counting sort. Optimized for scenarios where a primary key can be extracted to index elements into buckets.

by NailxSharipov

2 unstable releases

0.2.0 Sep 29, 2024
0.1.0 Sep 19, 2024

#710 in Algorithms

Download history 62/week @ 2024-10-09 69/week @ 2024-10-16 273/week @ 2024-10-23 4318/week @ 2024-10-30 6943/week @ 2024-11-06 6295/week @ 2024-11-13 6834/week @ 2024-11-20 8184/week @ 2024-11-27 8982/week @ 2024-12-04 7747/week @ 2024-12-11 7038/week @ 2024-12-18 4333/week @ 2024-12-25 11886/week @ 2025-01-01 11470/week @ 2025-01-08 11610/week @ 2025-01-15 10320/week @ 2025-01-22

45,955 downloads per month
Used in 49 crates (via i_overlay)

MIT license

7KB
159 lines

iKeySort

A fast sorting algorithm combining bin and counting sort. Optimized for scenarios where a primary key can be extracted to index elements into buckets.

No runtime deps