orlp/glidesort

Health v2 · maintenance only

Flags: no_releases no_license

Adoption not part of the score

1656 stars · 25 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded

Glidesort is a Rust library implementing a novel stable adaptive sorting algorithm that hybridizes Timsort-style merge sorting with pattern-defeating quicksort. It achieves O(n) best-case time on pre-sorted data and excels on inputs with many duplicates while remaining fast on random data.

Use cases

• sort large arrays faster than the standard library sort
• sort data with many duplicate keys efficiently
• sort nearly-sorted data in linear time
• drop-in replacement for Vec::sort in Rust
• sort with a custom auxiliary memory buffer
• reuse allocation across repeated sorts of a Vec

When to choose

• you need a stable sort with excellent performance on patterned or duplicate-heavy data
• you want a fast drop-in replacement for Rust's built-in sort
• you need control over auxiliary memory usage during sorting

When to avoid

• you only need the standard library's sort and don't care about edge-case performance
• you cannot tolerate any auxiliary memory allocation and have extremely skewed data
• you need a license other than the implicit default (no explicit license is provided)

Facets

library · maturity stable

math developer-tools rust sorting stable-sort quicksort mergesort adaptive-algorithm comparison-sort algorithms

Member repositories

For agents

markdown · JSON · MCP: product_card(name="orlp/glidesort")