Results for benchmark_sort

A collection of sorting algorithms

Procedural macros for mobench benchmarks with setup, teardown, and per-iteration support

Guacamole provides a linearly-seekable random number generator.

Run benchmarks anywhere in your codebase and integrate performance checks directly into your cargo test pipeline.

Property-based benchmarking integration between Protest and Criterion

High-throughput method to count abundance of unique line in the style of `sort | uniq -c`

OCaml (subset) to LLVM IR compiler front-end

Unix sort but in parallel

rust benchmark with memory

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

Pattern-defeating quicksort

Topological sorting algorithm for directed graphs.