Pattern-defeating quicksort
A copy of the core::slice::sort module from the Rust 1.56.1 standard library, modified to behave the same on 32-bit platforms as on 64-bit. This is intended to work around a determinism bug in the halo2_proofs crate.
Parallel implementation of crumsort optmized for uniform distributions
Selects the kth smallest element of a slice, based on Orson Peters's Pattern Defeating Quickselect
Fast adaptive sorting for when most of your data is already in order. dmsort can be 2-5 times faster than Rust's default sort when more than 80% of the elements are already in order.
A cache-friendly Bentley-Saxe logarithmic array data structure.
some common rust_algorithms, Everyone can participate, and the project will continue to be updated, all the algorithms comes from <Introduction to Algorithms III>
An efficient vector-graphics renderer
A high-performance, index-based data structure toolkit. Provides an arena allocator (ElemPool) used to build a cache-friendly PieList (doubly-linked list) and FibHeap (priority queue).
A high-performance Radix Sort implementation using base-256 for u32.