SotSort: a stable quicksort with a tunable buffer

SotSort is a stable comparison sort whose single code path runs with anything from a fixed 16 KB buffer to a full n-element buffer. Its core is a stable quicksort that partitions blocks through the buffer and gathers them with rotations. This report summarises the design, states which parts are borrowed, and compares an implementation against blitsort, fluxsort, glidesort, driftsort, GrailSort and WikiSort. On one 2-vCPU machine, with 32- and 64-bit integers, the constant-memory mode takes between 0.19 and 0.75 of blitsort's time on 16 of 22 input classes and between 0.94 and 1.09 on the other six. With a comparator that rules out the vector partition it is slower than blitsort on 7 of 11 classes, by up to 2.6 times on sorted input. All numbers are preliminary.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-18
DOI
https://doi.org/10.48550/arxiv.2611.24786
Primary Topic
Algorithms and Data Compression
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

SotSort: a stable quicksort with a tunable buffer

Lucas Sotomayor
arXiv (Cornell University)
Algorithms and Data Compression
preprint

SotSort: a stable quicksort with a tunable buffer

Lucas Sotomayor
preprint en

Abstract

SotSort is a stable comparison sort whose single code path runs with anything from a fixed 16 KB buffer to a full n-element buffer. Its core is a stable quicksort that partitions blocks through the buffer and gathers them with rotations. This report summarises the design, states which parts are borrowed, and compares an implementation against blitsort, fluxsort, glidesort, driftsort, GrailSort and WikiSort. On one 2-vCPU machine, with 32- and 64-bit integers, the constant-memory mode takes between 0.19 and 0.75 of blitsort's time on 16 of 22 input classes and between 0.94 and 1.09 on the other six. With a comparator that rules out the vector partition it is slower than blitsort on 7 of 11 classes, by up to 2.6 times on sorted input. All numbers are preliminary.

arXiv (Cornell University)
Algorithms and Data Compression
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon