Results for stable_sort

WikiSort is generally as fast as a standard merge sort while using O(1) memory, and is even faster when the input is partially ordered or as the arrays get larger

Counting sort algorithm.

Binary-size optimized stable and unstable sorts

Array tools plugin for the Mumu ecosystem

Sort arrays given a permutation

Fast and robust slice-based algorithms (e.g., sorting, selection, search) for non-contiguous (sub)views into n-dimensional arrays.

State of the art radix sort algorithms. Single thread and multi thread versions.

Micro-benchmarking utilities with statistical analysis, comparison, and regression detection

Deterministic and stable topological sorting algorithms

High-performance Rust implementation of GNU sort with zero-copy operations, SIMD optimization, and parallel processing

Stable functions for checking iterator sorting.

A tool for processing markdown files to extract and format timesheet data

Library for inverse lexicographic (a tergo) sorting