scandum/quadsort
Quadsort is a branchless stable adaptive mergesort faster than quicksort. observed · 2026-08-28
Health v2 · maintenance only
32/100
- Activity 0
- Release rhythm 35
- Longevity 100
Flags: no_releases
How is this computed?
round(0.45*activity + 0.35*rhythm + 0.20*longevity); archived -> min(score, 10) — computed 2026-09-02. Adoption (stars, forks) is never an input.
- gap_med: n/a
- age_days: 2395
- days_rel: n/a
- days_push: 767
- n_releases_24m: 0
Adoption not part of the score
2203 stars · 110 forks observed · 2026-08-28
What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded
Quadsort is a branchless stable adaptive merge sort implemented in C, designed to outperform quicksort on many workloads. It uses a quad swap analyzer to detect ordered and reverse-ordered data with minimal comparisons before merging.
Use cases
- sort arrays faster than quicksort
- stable sorting in C
- sort nearly-ordered data efficiently
- branchless sorting algorithm
- compare sorting algorithms like timsort
- learn how adaptive merge sort works
When to choose
- You need a stable, adaptive sort in C with strong performance on partially ordered data
- You want a public-domain (Unlicense) sorting implementation to embed in a project
- You are benchmarking or studying sorting algorithm design
When to avoid
- You need a sort in a language other than C without porting
- You just need a built-in standard library sort and don't care about micro-optimizations
- You need parallel or external (disk-based) sorting
Facets
library · maturity active
benchmarking math performance developer-tools c cross-platform sorting merge-sort branchless stable-sort adaptive-sort algorithms
1 source
- readme: https://github.com/scandum/quadsort · fetched 2026-08-28 · 2cac8f0d94f1
Member repositories
| Repository | Role | Health v2 |
|---|---|---|
| scandum/quadsort | main | 32 |
For agents
markdown · JSON · MCP: product_card(name="scandum/quadsort")
Data as of 2026-08-30T08:39:29.467469+00:00 · Report a problem