Dev tools · alternatives · 2026
24 alternatives to An update-aware approach to incremental sorting (DeltaSort)
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…
Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes.
- 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 →
- 3
SORTING▲184Visualization of some of the most famous sorting algorithms
2015 · marktwirtschaft.at · its alternatives →
- 4
The world's fastest general purpose sorting algorithm, 60% faster than Quicksort - hackware1993/ChenSort
2022 · github.com · its alternatives →
- 5WA
2011 · visualsort.appspot.com · its alternatives →
- 6
Hey there HN! We’re Antonio, Luca, and Yuhang, and we’re excited to introduce Fast GraphRAG, an open-source RAG approach that leverages knowledge graphs and the 25 years old PageRank for better information retrieval and reasoning. Building a good RAG pipeline these days takes a lot of manual optimizations. Most engineers intuitively start from naive RAG: throw everything in a vector database and hope that semantic search is powerful enough. This can work for use cases where accuracy isn’t too important and hallucinations are tolerable, but it doesn’t work for more difficult queries that…
2024 · github.com · its alternatives →
- 7IQ
A propos de Mastalab
2017 · illustrated-algorithms.now.sh · its alternatives →
- 8
Quadsort is a branchless stable adaptive mergesort faster than quicksort. - scandum/quadsort
2023 · github.com · its alternatives →
- 9
A powerful pixel-sorting tool written in Java
2014 · pixeldrifter.tumblr.com · its alternatives →
- 10
Sortd for Gmail▲556Trello for Gmail - Transform your email into organized lists
2015 · sortd.com · its alternatives →
- 11
- 12AC
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 →
- 13
Improve UX by watching how users organise information
2024 · ballparkhq.com · its alternatives →
- 14
Fast SIMD sorting routines for int and float arrays - zvrba/SortingNetworks
2021 · github.com · its alternatives →
- 15SP
2019 · wtracy.gitlab.io · its alternatives →
- 16
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 →
- 17
- 18IM
2017 · medium.com · its alternatives →
- 19
- 20HB
2014 · quicksort-heap.herokuapp.com · its alternatives →
- 21
2015 · 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 →
- 24S5
Sorting 50K Array with Bubble Sort
2016 · afshinm.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
- SORTING alternatives
- I developed a fast general purpose sorting algorithm alternatives
- Write a sort, watch it go alternatives
- FastGraphRAG – Better RAG using good old PageRank 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 →