Life & fun · alternatives · 2026
24 alternatives to QuadSort, Esoteric Fast Sort
Quadsort is a branchless stable adaptive mergesort faster than quicksort. - scandum/quadsort
QuadSort is a sorting algorithm released on GitHub. It's designed for developers and computer scientists interested in esoteric or specialized sorting methods. The algorithm stands out as a fast sorting approach… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes. QuadSort, Esoteric Fast Sort launched in 2023; newer entries below may have overtaken it.
- 1
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.
2023 · github.com · its alternatives →
- 2XI
2013 · gkoberger.github.com · its alternatives →
- 3IQ
A propos de Mastalab
2017 · illustrated-algorithms.now.sh · its alternatives →
- 4
The world's fastest general purpose sorting algorithm, 60% faster than Quicksort - hackware1993/ChenSort
2022 · github.com · its alternatives →
- 5
Fast SIMD sorting routines for int and float arrays - zvrba/SortingNetworks
2021 · github.com · its alternatives →
- 6SP
2019 · wtracy.gitlab.io · its alternatives →
- 7AC
I'm making a coloring book of data structures and algorithms for programmers and students. So far I have a prototype page for a sorting algorithm (albeit a rather simple one). Here the Selection Sort coloring pages you can print. https://coderscoloringbook.com/selectionsort And here is how I colored mine. https://coderscoloringbook.com/selectionsortcolored A coloring book is not quite enough to teach algorithms on its own, but I really get a lot from visual reinforcement of what I learn from books/lectures. Do you think having coloring pages like this could…
2017 · its alternatives →
- 8
Paper (PDF): https://github.com/shudv/deltasort/blob/main/paper/main.pdf I’ve been exploring a variant of the sorting problem where the sort routine knows about which indices were updated since the previous sort. This situation arises in many practical systems: large sorted lists that are read frequently, updated in small batches, and where the update pipeline already knows which positions changed (e.g., UI lists, leaderboards). Despite this most systems either re-sort the entire array or apply independent binary insertions or perform…
Jan 2026 · github.com · its alternatives →
- 9AV
2012 · bost.ocks.org · its alternatives →
- 10
Contribute to sacert/Color-Merge-Sort development by creating an account on GitHub.
2017 · github.com · its alternatives →
- 11
- 12
This project presents a new data structure for storing ordered integer maps. The proposed data structure is a compressive, cache-friendly, radix tree that has performance comparable to an unordered map (`std::unordered_map`) and is an order of magnitude faster than an ordered map (`std::map`).
2024 · github.com · its alternatives →
- 13
I built Chonkie because I was tired of rewriting chunking code for RAG applications. Existing libraries were either too bloated (80MB+) or too basic, with no middle ground. Core features: - 21MB default install vs 80-171MB alternatives - 33x faster token chunking than popular alternatives - Supports multiple chunking strategies: token, word, sentence, and semantic - Works with all major tokenizers (transformers, tokenizers, tiktoken) - Zero external dependencies for basic functionality Technical optimizations: - Uses tiktoken with multi-threading for faster tokenization - Implements…
2024 · github.com · its alternatives →
- 14HB
2014 · quicksort-heap.herokuapp.com · its alternatives →
- 15
I 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.
2025 · github.com · its alternatives →
- 16
Mmap radix sort file by a fixed length prefix of each line - afiodorov/radixmmap
2020 · github.com · its alternatives →
- 17
Experimental C implementation of “Breaking the Sorting Barrier for Directed Single-Source Shortest Paths” by Ran Duan, Jiayi Mao, Xiao Mao, Xinkai Shu, and Longhui Yin (STOC 2025) - danalec/DMMSY-SSSP
Feb 2026 · github.com · its alternatives →
- 18
I want to share a really dumb, but very practical project I have packaged this summer, to perform operations on strings much faster. I was using Python to work with a multi-terabyte newline-delimited file. Reading, splitting, and shuffling it was a nightmare. So, I wrapped a trivial hardware-friendly heuristic I've been using for the last few years into a CPython library. The part I enjoyed the most is implementing SIMD behavior without SIMD instructions... Using 64-bit words to work at 8-bit granularity. Unlike conventional SIMD, the code would remain the same for ~~almost~~ any hardware.…
2023 · ashvardanian.com · its alternatives →
- 19
A powerful pixel-sorting tool written in Java
2014 · pixeldrifter.tumblr.com · its alternatives →
- 20AG
This is a vector index I built that supports insertion and k-nearest neighbors (k-NN) querying, optimized for GPUs. It operates entirely in CUDA and can process queries on half a billion vectors in under 200 milliseconds. The codebase is structured as a standalone library with an HTTP API for remote access. It’s intended for high-performance search tasks—think similarity search, AI model retrieval, or reinforcement learning replay buffers. The codebase is located at https://github.com/rodlaf/BinaryGPUIndex.
2025 · rlafuente.com · its alternatives →
- 21
Bubble sort is pretty simple in most programming languages ... what about on a Turing Machine? I used all three of Claude 4.6, GLM 5, and GPT 5.2 to get a result, so this exercise was not quite trivial, at least at this time. The resulting machine, bubble_sort_unary.yaml, will take this input: 111011011111110101111101111 and give this output: 101101110111101111101111111 I.e., it's sorting the array [3,2,7,1,5,4]. The machine has 31 states and requires 1424 steps before it comes to a halt. It also introduces two extra symbols onto the tape, 'A' and 'B'. (You could argue that 0 is also an…
Feb 2026 · github.com · its alternatives →
- 22
- 23OA
I made an early version of a sorted collection library for Zig. Sorted collections are data structures that maintain the data in sorted order. Examples of these data structures are `java.util.TreeMap` in Java and `std::map` in C++. These data structures are mainly used for fast lookups (point search) and fast range searches. The library is available on GitHub: https://github.com/CogitatorTech/ordered
Oct 2025 · its alternatives →
- 24IV
Tone of Sorting allows you to interactivly visualize how sorting algorithms work with sound
2017 · caspervonb.github.io · its alternatives →
Also compare
- Glidesort, a new stable sort in Rust up to ~4x faster for random data alternatives
- XKCD-inspired StackSort alternatives
- Illustrated Quicksort algorithm alternatives
- I developed a fast general purpose sorting algorithm alternatives
- Fast(er) Sorting with Sorting Networks alternatives
- Sortraits, Portraits of Sorting Algorithms alternatives
Ranked by how close each launch is in meaning, then by votes. Prices were read from each product’s own site when checked and can change. Refine with your own description →