AI · alternatives · 2026
24 alternatives to Bubble sort on a Turing machine
Bubble sort is pretty simple in most programming languages ... what about on a Turing Machine? I used all three of Claude 4.6, GLM 5, and GPT 5.2 to get a result, so this exercise was not quite trivial, at least at this time. The resulting machine, bubble_sort_unary.yaml, will take this input: 111011011111110101111101111 and give this output: 101101110111101111101111111 I.e., it's sorting the array [3,2,7,1,5,4]. The machine has 31 states and requires 1424 steps before it comes to a halt. It also introduces two extra symbols onto the tape, 'A' and 'B'. (You could argue that 0 is also an…
This project implements bubble sort algorithms on a Turing machine, a theoretical computing model. Two versions are provided: one using unary notation with 31 states and 1424 steps to sort arrays like [3,2,7,1,5,4]… Below are 24 products that do a similar job, ranked by how close each is in meaning and then by launch-day votes.
- 1S5
Sorting 50K Array with Bubble Sort
2016 · afshinm.github.io · its alternatives →
- 2XI
2013 · gkoberger.github.com · its alternatives →
- 3IM
This is the first iteration of a short game I’m making that tries to interactively explain some of my favorite math questions / ideas. My goal is mostly to get the player curious and not necessarily to explain absolutely everything. There were a lot of fun technical parts to building this: - For implementation reasons, it’s much easier if the lines all have integer intersection points with each other. To do this, when a new line is added I “cheat” by rounding intersections to integers and then splitting the old lines at the intersection into new linds (with potentially different slopes)…
2024 · rahulilango.com · its alternatives →
- 4
The world's fastest general purpose sorting algorithm, 60% faster than Quicksort - hackware1993/ChenSort
2022 · github.com · its alternatives →
- 5
Stephen Wolfram's new book on the Wolfram Language
2015 · wolfram.com · its alternatives →
- 6
Fast SIMD sorting routines for int and float arrays - zvrba/SortingNetworks
2021 · github.com · its alternatives →
- 7
Quadsort is a branchless stable adaptive mergesort faster than quicksort. - scandum/quadsort
2023 · github.com · its alternatives →
- 8
- 9SP
2019 · wtracy.gitlab.io · its alternatives →
- 10
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) - danalec/DMMSY-SSSP
Feb 2026 · github.com · its alternatives →
- 11
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 →
- 12
My implementations of deterministic and non-deterministic turing machines - yedhukrishnan/turing-machine
2015 · github.com · its alternatives →
- 13
Hey HN! I've been curious about the history of computer science and decided to try to read Turing's 1936 paper where he conceptualizes the Turing Machine, etc. I had trouble understanding the paper, read The Annotated Turing by Charles Petzold (which is wonderful), but felt that reading a reference implementation would help formalize my understanding. When I couldn't find an open source implementation, I decided to write my own. The implementation includes: - Abbreviated tables (m-functions) - Conversions to Standard Descriptions and Description Numbers - A working universal machine - A…
2023 · github.com · its alternatives →
- 14
I want to share a really dumb, but very practical project I have packaged this summer, to perform operations on strings much faster. I was using Python to work with a multi-terabyte newline-delimited file. Reading, splitting, and shuffling it was a nightmare. So, I wrapped a trivial hardware-friendly heuristic I've been using for the last few years into a CPython library. The part I enjoyed the most is implementing SIMD behavior without SIMD instructions... Using 64-bit words to work at 8-bit granularity. Unlike conventional SIMD, the code would remain the same for ~~almost~~ any hardware.…
2023 · ashvardanian.com · its alternatives →
- 15
This is a small plugin I made for Simon Willison's llm utility. You can do things like: cat names.txt | llm sort -q "Which one of these names is best for a pet seagull?" cat books.txt | llm sort -q "Which book is more related to basic vs. advanced CS topics?" I see a lot of potential marrying LLMs with classic UNIX interfaces.
2025 · github.com · its alternatives →
- 16
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 →
- 17
a total and turing complete [?] programming language - raoofha/Ar
2024 · github.com · its alternatives →
- 18
Author: Danison Nuñez Project: Coderive Project Type: Programming Language Highlight: Formula-based Execution ## Coderive - Iterating Through 1 Quintillion in a Loop *Subtitle: How a phone interpreter achieves what supercomputers cannot* The Impossible Loop: ```java // In any other language, this would be computational suicide for i in [0 to 1Qi] { // 1,000,000,000,000,000,000 iterations arr[i] = i * i } ``` Traditional Reality: · Python: MemoryError at array creation · Java/C++: Theoretical 31 years (with 8 exabytes of RAM) · NumPy/TensorFlow: Immediate crash ·…
Dec 2025 · github.com · its alternatives →
- 19
- 20
I made a simple GraphRAG call nano-graphrag. The reason is I try to hack the official implementation released by Microsoft but that version is very hard to read/hack. This algorithm should not be implemented that annoying, I think. So I made a simpler one. It's about 800-900 lines of Python, and it's portable.
2024 · github.com · its alternatives →
- 21
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 · its alternatives →
- 22
Wordfall▲13I've been working on this for a while as an experiment and I'm now pretty happy with it. I've always written code, but I've always been a frankly incompetent frontend developer, and I've never really been able to talk myself into making a game; it was just too much trouble, even though I had ideas I wanted to try! Claude Code made it possible for the first time. I hope you like it. I'm still working on it!
2025 · playwordfall.com · its alternatives →
- 23
Contribute to sacert/Color-Merge-Sort development by creating an account on GitHub.
2017 · github.com · its alternatives →
- 24OA
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 →
Also compare
- Sorting 50K Array, HTML5 Web Worker Demo alternatives
- XKCD-inspired StackSort alternatives
- I made a puzzle game that gently introduces my favorite math mysteries alternatives
- I developed a fast general purpose sorting algorithm alternatives
- An Elementary Introduction to the Wolfram Language alternatives
- Fast(er) Sorting with Sorting Networks 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 →