nowfound

Life & fun · free · 2026

IQ

24 free alternatives to Illustrated Quicksort algorithm

A propos de Mastalab

Below are 24 products that do a similar job and cost nothing to start: 20 free outright and 4 with a free plan and paid upgrades. Each price was read from the product's own site. They are ranked by how close each is in meaning, then by launch-day votes.

  1. 1

    Quadsort is a branchless stable adaptive mergesort faster than quicksort.

    2023 · github.com · price checked November 2026

  2. 2
    AnimStatsFree plan, paid from $9.99/mo▲933

    Get x10 more engagement, grab attention with animated videos

    2024 · animstats.com · price checked November 2026

  3. 3
    GlidesortFree▲389

    Glidesort is a stable sorting algorithm for Rust that achieves significantly improved performance on random data compared to standard implementations.

    2023 · github.com · price checked November 2026

  4. 4
    ChenSortFree▲56

    The world's fastest general purpose sorting algorithm, 60% faster than Quicksort

    2022 · github.com · price checked November 2026

  5. 5
    FastGraphRAGFree▲457

    FastGraphRAG is an open-source retrieval-augmented generation system that combines knowledge graphs with the PageRank algorithm to improve information retrieval and reasoning.

    2024 · github.com · price checked November 2026

  6. 6

    Creating high-quality scientific figures can be time-consuming and challenging, even though sketching ideas on paper is relatively easy. Furthermore, recreating existing figures that are not stored in formats preserving semantic information is equally complex. To tackle this problem, we introduce DeTikZify, a novel multimodal language model that automatically synthesizes scientific figures as semantics-preserving TikZ graphics programs based on sketches and existing figures. We also introduce a Monte Carlo Tree Search-based inference algorithm that enables DeTikZify to iteratively refine its…

    2024 · github.com · price checked November 2026

  7. 7
    JAQTFree▲100

    JAQT is a JavaScript library that simplifies searching, sorting, and filtering arrays of objects using a syntax inspired by GraphQL and SQL.

    2024 · github.com · price checked November 2026

  8. 8
    inspectusFree▲197

    Inspectus allows you to create interactive visualizations of attention matrices with just a few lines of Python code. It’s designed to run smoothly in Jupyter notebooks through an easy-to-use Python API. Inspectus provides multiple views to help you understand language model behaviors. If you have any questions, feel free to ask!

    2024 · github.com · price checked November 2026

  9. 9

    This project formalizes the first volume of Bertrand Russell's Principia Mathematica using the Lean theorem prover.

    2025 · github.com · price checked November 2026

  10. 10
    TimberFree▲207

    Ollama for classical ML models. AOT compiler that turns XGBoost, LightGBM, scikit-learn, CatBoost & ONNX models into native C99 inference code. One command to load, one command to serve. 336x faster than Python inference.

    Mar 2026 · github.com · price checked November 2026

  11. 11

    Long-simmering side project that is finally ready to see the light. HAMTs are a cool persistent data structure and implementing one has been a lot of fun. Beyond the code, there is likely some value in the extensive and largely complete implementation docs; basic benchmarks are linked in the README, too. Kind of aiming to be "the libavl for HAMTs". That is obviously a high and aspirational bar but a distinct possibility if it stirs up a little interest and/or contribution. Anyways, it's time for this to go out, collect feedback and maybe even some use outside of toy projects. Let me…

    2023 · github.com · price checked November 2026

  12. 12

    Zig Topological Sort Library for Parallel Processing is a dependency graph management library for Zig that builds dependency graphs, performs topological sorting, and generates dependency-free…

    2025 · github.com · price checked November 2026

  13. 13

    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)

    Feb 2026 · github.com · price checked November 2026

  14. 14
    PhotosweepFree plan▲100

    The fastest way to manually sort photos

    2023 · apps.apple.com · price checked November 2026

  15. 15
    FacadFree▲147

    Facad is about functionality, not just aesthetics. Key features: - Intuitive file type representation - Smart sorting (directories first, then by extension) - Four-column layout for quick directory analysis It evolved from this alias: alias ls='ls -A -F --group-directories-first --sort=extension --color=always' Facad takes this concept further, offering more flexibility and visual clarity.

    2024 · github.com · price checked November 2026

  16. 16
    SisiFree▲128

    Sisi is a command-line tool for searching images by text description, running entirely on a user's computer without external APIs.

    2024 · github.com · price checked November 2026

  17. 17

    Incremental sorting algorithm for arrays with known updates

    Jan 2026 · github.com · price checked November 2026

  18. 18
    Picsellia AtlasFree plan, paid from $10.80/mo▲155

    The complete MLOps platform for computer vision. Build, deploy, and monitor vision AI applications at scale with Picsellia.

    2025 · picsellia.com · price checked November 2026

  19. 19
    PenmentorFree▲66

    AI mentor that reads your math.

    Oct 2026 · github.com · price checked November 2026

  20. 20
    FlideFree▲126

    🔥🔥 The fastest inference engine for decision model

    14d ago · github.com · price checked November 2026

  21. 21
    PicsortaFree▲3

    Sort your photos into folders at the speed of thought

    Jul 2026 · picsorta.com · price checked November 2026

  22. 22

    A library for object detection and seamless YOLO model integration in Elixir

    2024 · github.com · price checked November 2026

  23. 23

    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 · price checked November 2026

  24. 24
    ChartPixelFree plan, paid from $15/mo▲80

    Extract & visualize key insights from raw data in seconds!

    2024 · chartpixel.com · price checked November 2026

All alternatives to Illustrated Quicksort algorithm, paid too →About Illustrated Quicksort algorithm →

Free means the product’s own site says it is free or offers a free plan, as read on the date shown. Plans change; check the site before you rely on one.