Alternatives

Products that do what Sorted list data struct with insert/get(index) in lg time does

1. 1AW
   Array with Constant Time Access and Fast Insertion and Deletion▲300

   2019 · github.com

2. 2IQ
   Illustrated Quicksort algorithm▲187

   2017 · illustrated-algorithms.now.sh

3. 3RE
   Retool: Excel-like, with higher order primitives▲190

   2017 · retool.in

4. 4AA
   Array – A Better Python List▲87

   2021 · github.com

5. 5DJ
   Datagridxl.js – No-nonsense fast Excel-like data table library▲238

   2020 · datagridxl.com

6. 6SS
   StrelkiJS - small library to index and SQL-join in-memory collections▲41

   2016 · github.com

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

   2020 · github.com

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

   2016 · afshinm.github.io

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

   2019 · wtracy.gitlab.io

10. 10SS
    Stack – Save and explore books and book lists▲156

    2019 · stack.app

11. 11AF
    A fast append-only data store for Java 8▲74

    2015 · probablyfine.co.uk

12. 12DA
    Drag and drop sorting and reordering script for nested structures▲8

    2017 · supraniti.github.io

13. 13CL
    Command Line Tool to Sort CSV and TSV Files by Multiple Headings in Go▲29

    2018 · github.com

14. 14FS
    Fast suffix arrays in Python▲72

    2017 · louisabraham.github.io

15. 15FE
    Fast(er) Sorting with Sorting Networks▲28

    2021 · github.com

16. 16AL
    A LRU cache using go generics▲57

    2022 · github.com

17. 173M
    33% Memory Reduction by Reordering Struct Fields▲19

    2020 · qvault.io

18. 18IM
    I made an app to buffer and complete my "read later" list▲53

    2021 · closetab.email

19. 19AU
    An update-aware approach to incremental sorting (DeltaSort)▲6

    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

20. 20SJ
    sortByTimeAgo.js - A jQuery plugin I'm working on to sort by time ago.▲10

    2012 · github.com

21. 21AS
    A set of handy tools to work with sequences and collections in Python▲29

    2013 · github.com

22. 22IS
    Incrediibli simple shared lists▲6

    2015 · diib.li

23. 23CM
    Color Merge Sort▲35

    2017 · github.com

24. 24HB
    Heap-Based Quicksort, Visualized▲7

    2014 · quicksort-heap.herokuapp.com

Ranked by how close each launch is in meaning, then by votes. Refine with a description →