Life & fun · alternatives · 2026

24 alternatives to Fast(er) Sorting with Sorting Networks

Fast SIMD sorting routines for int and float arrays - zvrba/SortingNetworks

This project implements sorting networks, a method for sorting data using a fixed sequence of comparisons that can be parallelized. Available on GitHub, it's designed for developers and computer scientists interested… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes. Fast(er) Sorting with Sorting Networks launched in 2021; newer entries below may have overtaken it.

1. 1
   Zig Topological Sort Library for Parallel Processing▲114

   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 →

2. 2
   I developed a fast general purpose sorting algorithm▲56

   The world's fastest general purpose sorting algorithm, 60% faster than Quicksort - hackware1993/ChenSort

   2022 · github.com · its alternatives →

3. 3
   Glidesort, a new stable sort in Rust up to ~4x faster for random data▲389

   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 →

4. 4XI
   XKCD-inspired StackSort▲948

   2013 · gkoberger.github.com · its alternatives →

5. 5AC
   A coloring book of data structures and algorithms▲523

   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 →

6. 6SP
   Sortraits, Portraits of Sorting Algorithms▲132

   2019 · wtracy.gitlab.io · its alternatives →

7. 7
   QuadSort, Esoteric Fast Sort▲78

   Quadsort is a branchless stable adaptive mergesort faster than quicksort. - scandum/quadsort

   2023 · github.com · its alternatives →

8. 8
   Sortd for Gmail▲556

   Trello for Gmail - Transform your email into organized lists

   2015 · sortd.com · its alternatives →

9. 9OA
   Ordered – A sorted collection library for Zig▲21

   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 →

10. 10IQ
    Illustrated Quicksort algorithm▲187

    A propos de Mastalab

    2017 · illustrated-algorithms.now.sh · its alternatives →

11. 11
    Integer Map Data Structure▲91

    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 →

12. 12
    C99 implementation of new O(m log^(2/3) n) shortest path algorithm▲111

    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 →

13. 13
    Sorted³▲260

    Schedule events, tasks, and notes

    2018 · sortedapp.com · its alternatives →

14. 14S5
    Sorting 50K Array, HTML5 Web Worker Demo▲88

    Sorting 50K Array with Bubble Sort

    2016 · afshinm.github.io · its alternatives →

15. 15
    Sortd for Slack▲323

    Get Trello-style project boards right in your Slack!

    2017 · sortd.com · its alternatives →

16. 16
    SORTING▲184

    Visualization of some of the most famous sorting algorithms

    2015 · marktwirtschaft.at · its alternatives →

17. 17
    Sortabase, a collaborative, visual database builder for communities▲116

    We built Sortabase to let communities collaborate on visual databases of the things they know and care about. The fields of each database are defined by its moderators using a no-code drag-n-drop interface, and the resulting database is easy to search, filter, sort, and contribute to. The platform is 100% free to use - take a look, and feedback is appreciated!

    2023 · sortabase.com · its alternatives →

18. 18
    Sort▲191

    GitHub workflows for managing your most valuable data

    2025 · sort.xyz · its alternatives →

19. 19
    Card sorting by Ballpark▲207

    Improve UX by watching how users organise information

    2024 · ballparkhq.com · its alternatives →

20. 20
    A Python container for dataclasses with multi-indexing and vector opps▲122

    A container for dataclasses with multi-indexing and bulk operations. - joshlk/dataclassframe

    2020 · github.com · its alternatives →

21. 21AG
    A GPU-accelerated binary vector index▲65

    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 →

22. 22
    Pg_sorted_heap–Physically sorted PostgreSQL with builtin vector search▲10

    Sorted heap table AM for PostgreSQL with zone map scan pruning - skuznetsov/pg_sorted_heap

    Mar 2026 · github.com · its alternatives →

23. 23
    Sorted list data struct with insert/get(index) in lg time▲18

    2015 · github.com · its alternatives →

24. 24
    Color Merge Sort▲35

    Contribute to sacert/Color-Merge-Sort development by creating an account on GitHub.

    2017 · github.com · its 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 →