i_key_sort
| Crates.io | i_key_sort |
| lib.rs | i_key_sort |
| version | 0.2.0 |
| source | src |
| created_at | 2024-09-19 18:14:48.084656 |
| updated_at | 2024-09-29 17:06:05.580386 |
| description | A fast sorting algorithm combining bin and counting sort. Optimized for scenarios where a primary key can be extracted to index elements into buckets. |
| homepage | |
| repository | https://github.com/iShape-Rust/iKeySort |
| max_upload_size | |
| id | 1380569 |
| size | 7,972 |
Nail (NailxSharipov)
documentation
README
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.