Glidesort, a new stable sort in Rust up to ~4x faster for random data
Hi all, I've talked about glidesort a few times on HN already, but it's finally ready for release. If you have any questions, feel free to ask. An academic paper on glidesort that goes into a lot more detail than the readme is upcoming, but is not ready yet. I will be giving a talk on glidesort tomorrow at FOSDEM 2023 in the Rust Devroom at 16:10, you can seek me out there as well. In other news, I am leaving academia soon, so if you have interesting (Rust) jobs the coming months feel free to approach me.
Glidesort, a new stable sort in Rust up to ~4x faster for random data launched on February 3, 2023 with 389 votes, #46 of 3,829 launches that month and more than 99% of that year's launches. The site was still online in September 2026, 3 years on.
In plain words
Glidesort is a stable sorting algorithm for Rust that achieves significantly improved performance on random data compared to standard implementations. Designed for developers working with Rust, it offers up to 4x faster sorting speeds in certain scenarios. The algorithm is available as open-source code, with detailed academic documentation planned for future release.
written from the facts on this page · September 2026
From the sources
A Rust implementation of Glidesort, my stable adaptive quicksort/mergesort hybrid sorting algorithm. - GitHub - orlp/glidesort: A Rust implementation of Glidesort, my stable adaptive quicksort/mergesort hybrid sorting algorithm.
Does a similar job
all alternatives →
A hash array-mapped trie implementation in C2023 · github.com · ▲171Long-simmering side project that is finally ready to see the light. HAMTs are a cool persistent data structure and implementing one has been a lot of fun. Beyond the code, there is likely some value in the extensive and largely complete implementation docs; basic benchmarks are linked in the README, too. Kind of aiming to be "the libavl for HAMTs". That is obviously a high and aspirational bar but a distinct possibility if it stirs up a little interest and/or contribution. Anyways, it's time for this to go out, collect feedback and maybe even some use outside of toy projects. Let me…
Turbolite – a SQLite VFS serving sub-250ms cold JOIN queries from S3Mar 2026 · github.com · ▲185I built a SQLite VFS in Rust that serves cold queries directly from S3 with sub-second performance, and often much faster. It’s called turbolite. It is experimental, buggy, and may corrupt data. I would not trust it with anything important yet. I wanted to explore whether object storage has gotten fast enough to support embedded databases over cloud storage. Filesystems reward tiny random reads and in-place mutation. S3 rewards fewer requests, bigger transfers, immutable objects, and aggressively parallel operations where bandwidth is often the real constraint. This was explicitly inspired…
A fast HNSW implementation in Rust2024 · github.com · ▲111HNSW implementation in Rust. Reference: https://arxiv.org/ftp/arxiv/papers/1603/1603.09320.pdf - swapneel/hnsw-rust
- SASpart – A Rust library for fast spatial search with Python bindings2025 · ▲31
Hi everyone, I've made an open-source library for fast spatial search in Rust. It's called Spart, and it currently provides the following features: - Five tree implementations: Quadtree, Octree, Kd-tree, R-tree, and R*-tree - Python bindings (`pyspart` on PyPI) - Fast k-nearest neighbor (kNN) and radius search - Bulk data loading for efficient tree construction Project's GitHub repo: https://github.com/habedi/spart
Zig Topological Sort Library for Parallel Processing2025 · github.com · ▲114I believe the best way to learn a language is by doing an in-depth project. This is my first Zig project intended for learning the ropes on publishing a Zig package. It turns out to be quite solid and performant. It might be a bit over-engineered. This little library is packed with the following features: - Building dependency graph from dependency data. - Performing topological sort on the dependency graph. - Generating dependence-free subsets for parallel processing. - Cycle detection and cycle reporting.
QuadSort, Esoteric Fast Sort2023 · github.com · ▲78Quadsort is a branchless stable adaptive mergesort faster than quicksort. - scandum/quadsort
More dev tools this month
the category →
Contribute to oosexgang/hackios-xnu-kernel development by creating an account on GitHub.
Dev tools · 1d ago · github.com
open-source IDE for thoughtful software design. Contribute to devdotfast/whiteboard development by creating an account on GitHub.
Dev tools · 29d ago · github.com
Contribute to reladraw/reladraw development by creating an account on GitHub.
Dev tools · 27d ago · github.com
OpenBot▲362Grok Bot alternative: free, local, open-source, multiplayer
Dev tools · 24d ago · openbot.run
Talanoa▲346Hi HN, I’m a fullstack developer, and honestly, I’ve lost count of how many side projects I’ve worked on over the years. But one idea kept coming back to me: a different kind of email client. It first came to me in 2014: “What if we could handle emails more like conversations?” Every year, I’d revisit this concept in my “Build Notes.” Ten years later, no one had built exactly what I had in mind — so I finally decided to do it myself. That’s how Talanoa was born. I wanted something focused on people, not timelines. I was tired of marking messages as unread just to remember to reply later, or…
Dev tools · 22d ago · talanoa.email
Source: Show HN post ↗
