Life & fun · alternatives · 2026
24 alternatives to Sorted list data struct with insert/get(index) in lg time
This is a data structure implementation that maintains a sorted list while providing logarithmic-time operations for both inserting elements and retrieving items by index. Developers working with large datasets needing… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes. Sorted list data struct with insert/get(index) in lg time launched in 2015; newer entries below may have overtaken it.
- 1
Contribute to igushev/IgushArray development by creating an account on GitHub.
2019 · github.com · its alternatives →
- 2OA
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 →
- 3AC
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 →
- 4
Sortd for Gmail▲556Trello for Gmail - Transform your email into organized lists
2015 · sortd.com · its alternatives →
- 5
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 →
- 6
- 7
A container for dataclasses with multi-indexing and bulk operations. - joshlk/dataclassframe
2020 · github.com · its alternatives →
- 8WA
2011 · visualsort.appspot.com · its alternatives →
- 9
- 10IW
https://www.manning.com/books/data-oriented-programming-in-j... This book is a distillation of everything I’ve learned about what effective development looks like in Java (so far!). It's about how to organize programs around data "as plain data" and the surprisingly benefits that emerge when we do. Programs that are built around the data they manage tend to be simpler, smaller, and significantly easier understand. Java has changed radically over the last several years. It has picked up all kinds of new language features which support data oriented programming (records,…
2024 · its alternatives →
- 11
Rows▲511Import business data and analyze it using plain language.
2021 · rows.com · its alternatives →
- 12
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 →
- 13AF
2015 · probablyfine.co.uk · its alternatives →
- 14
As the creator of TerarkDB (acquired by ByteDance in 2019), I have developed ToplingDB in recent years. ToplingDB is forked from RocksDB, where we have replaced almost all components with more efficient alternatives(db_bench shows ToplingDB is about ~8x faster than RocksDB): * MemTable: SkipList is replaced by CSPP(Crash Safe Parallel Patricia trie), which is 8x faster. * SST: BlockBasedTable is replaced by ToplingZipTable, implemented by searchable compression algo, it is very small and fast, typically less than 1μs per lookup: * Keys/Indexes are compressed using NestLoudsTrie(a…
2025 · github.com · its alternatives →
- 15
🥞Data Structures and Algorithms explained and implemented in JavaScript + eBook - amejiarosario/dsa.js-data-structures-algorithms-javascript
2019 · github.com · its alternatives →
- 16
Fast SIMD sorting routines for int and float arrays - zvrba/SortingNetworks
2021 · github.com · its alternatives →
- 17
Row Zero is the best spreadsheet for big data. Build secure spreadsheets connected to your data warehouse with a bigger, faster Excel alternative in the cloud.
2024 · rowzero.io · its alternatives →
- 18
Grist▲290Evolution of spreadsheets to organize your data, your way
2021 · getgrist.com · its alternatives →
- 19
Recently created a minimal persistent relational database in Go. Main focus was on implementing & understanding working the of database, storage management & transaction handling. Use of B+ Tree for storage engine(support for indexing), managing a Free List (for reusing nodes), Support for transactions, Concurrent Reads. Still have many things to add & fix like query processing being one of the main & fixing some bugs Repo link - https://github.com/Sahilb315/AtomixDB Would love to hear your thoughts
2025 · github.com · its alternatives →
- 20
Features Spreadsheet-like interface All you want is here • Cell Editing: Directly click and edit content within cells. • Formula Support: Input mathematical and logical formulas to auto-calculate values. • Data Sorting and Filtering: Sort data based on a column or multiple columns; use filters to view specific rows of data. • Aggregation Function: Automatically summarize statistics for each column, providing instant calculations like sum, average, count, max, and min for streamlined data analysis. • Data Formatting: formatting numbers, dates, etc. • Grouping: Organize rows into collapsible…
2024 · github.com · its alternatives →
- 21
An on-disk B+tree for Python 3. Contribute to NicolasLM/bplustree development by creating an account on GitHub.
2018 · github.com · its alternatives →
- 22
Queue for Mac▲150To-do list, inspired by priority queue data structure
2016 · apps.apple.com · its alternatives →
- 23
Identify slow cards and bottlenecks on your Trello boards
2018 · bluecatreports.com · its alternatives →
- 24
Visual explanations of Algorithms and Data structures
2020 · chrislaux.com · its alternatives →
Also compare
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 →