Dev tools · alternatives · 2026
24 alternatives to Ordered – A sorted collection library for Zig
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
Ordered is an early-stage sorted collection library for the Zig programming language. It provides data structures that maintain elements in sorted order, enabling efficient point searches and range queries similar to… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes.
- 1
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
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 →
- 3
Zig library for HyperLogLog estimation. Contribute to axiomhq/zig-hyperloglog development by creating an account on GitHub.
2023 · github.com · its alternatives →
- 4AC
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 →
- 5
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 →
- 6
2015 · github.com · its alternatives →
- 7
Fast SIMD sorting routines for int and float arrays - zvrba/SortingNetworks
2021 · github.com · its alternatives →
- 8
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 →
- 9
Contribute to igushev/IgushArray development by creating an account on GitHub.
2019 · github.com · its alternatives →
- 10
A collection of high-performance data structures for Zig.
Dec 2025 · github.com · its alternatives →
- 11IQ
A propos de Mastalab
2017 · illustrated-algorithms.now.sh · its alternatives →
- 12
I started writing this book 10 years ago in JavaScript, got through a few chapters (asymptotic notation, basic techniques, start of sorting), and then abandoned it. Recently I picked it back up, converted everything to TypeScript, and used AI (Zenflow [1] + Claude Opus 4.6) to complete the remaining chapters. I provided the structure, direction, and initial chapters; the AI generated the bulk of the remaining content under a spec-driven workflow. The book covers roughly a first 1-2 year CS curriculum: sorting, dynamic programming, graph algorithms, trees, heaps, hash tables, and more. All…
Mar 2026 · amoilanen.github.io · its alternatives →
- 13
A container for dataclasses with multi-indexing and bulk operations. - joshlk/dataclassframe
2020 · github.com · its alternatives →
- 14
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 →
- 15
Doing dynamic dispatching in a strict static typing language is hard. Something as simple as, map.put("add", add); map.put("hello", hello); fn add(a: i32, b: i32) i32 { return a + b; } fn hello() []const u8 { return "Hello World"; } is impossible because the value type of key/value of the map needs to be the same but all the function types are different. Calling functions with different number of parameters, different parameter types, and different return type dynamically is difficult. Other languages either use dynamic typing, runtime reflection, macro, or passing in one big generic…
2025 · github.com · its alternatives →
- 16SP
2019 · wtracy.gitlab.io · its alternatives →
- 17
Decentralized, k-ordered unique IDs in Clojure. Contribute to maxcountryman/flake development by creating an account on GitHub.
2014 · github.com · its alternatives →
- 18
Visual explanations of Algorithms and Data structures
2020 · chrislaux.com · its alternatives →
- 19
Contribute to connorwstein/exchange development by creating an account on GitHub.
2020 · github.com · its alternatives →
- 20
HypergraphZ – directed hypergraph library in Zig with Python bindings - yamafaktory/hypergraphz
2024 · github.com · its alternatives →
- 21
The world's fastest general purpose sorting algorithm, 60% faster than Quicksort - hackware1993/ChenSort
2022 · github.com · its alternatives →
- 22
Hi all, I've made a javascript library to simplify searching/sorting/filtering in arrays of objects. Its inspired by both GraphQL and SQL, but implemented using javascript Proxies. Instead of creating a new language, its all just javascript. I've made it as part of an experimental database, which uses javascript as the query engine. The normal javascript map/reduce/sort functions are quite difficult to master for junior developers. JAQT is easier to explain, and can still be used in combination with any existing array functions. Please let me know what you think of the…
2024 · github.com · its alternatives →
- 23
HypergraphZ – directed hypergraph library in Zig with Python bindings - yamafaktory/hypergraphz
2024 · github.com · its alternatives →
- 24
Sorted heap table AM for PostgreSQL with zone map scan pruning - skuznetsov/pg_sorted_heap
Mar 2026 · github.com · its alternatives →
Also compare
- Zig Topological Sort Library for Parallel Processing alternatives
- Integer Map Data Structure alternatives
- HyperLogLog in Zig alternatives
- A coloring book of data structures and algorithms alternatives
- Glidesort, a new stable sort in Rust up to ~4x faster for random data alternatives
- Sorted list data struct with insert/get(index) in lg time 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 →