Sound of Sorting vs Turing Lab

Sound of Sorting visualizes 32 classic sorting algorithms with live audio and motion. Every comparison rings a note; every swap redraws a bar. Watch - and listen to - how each algorithm pulls an array from chaos into order. Originally released in 2013 as a C++ demo for university algorithms classes, Sound of Sorting has been viewed tens of millions of times on YouTube. This is the app version: native, fast, and rebuilt for touch and trackpad. WHAT YOU GET • 32 sorting algorithms, from familiar (Bubble, Selection, Insertion) to obscure (Cycle Sort, Smooth Sort, Block Merge Sort) • Real-time audio: every array access plays a tone whose pitch matches the value being read • Colored bars: access highlights, permanent marks, sorted regions — all in live animation • Adjustable array size (8 to 2048 elements) and animation speed • Step mode: advance one comparison at a time • Infinite Play: start a never-ending parade of random sorts • Live stats: comparison count and access count update as the sort runs FREE ALGORITHMS Six foundational sorts included at no cost: • Selection Sort • Insertion Sort • Binary Insertion Sort • Merge Sort (classical recursive) • Merge Sort (iterative) • Quick Sort - Hoare (LR ptrs) FULL COLLECTION — ONE-TIME PURCHASE Unlock the remaining 26 algorithms with a single $1.99 purchase: • More Quick Sorts - Lomuto (LL ptrs), ternary (LR ptrs, LL ptrs) and Dual-Pivot partition schemes • Bubble Sort, Cocktail Shaker Sort, Gnome Sort • Comb Sort • Shell Sort (Ciura gap sequences) • Heap Sort with heap level coloring • Smooth Sort • Odd-Even Sort, Bitonic Sort, Batcher's Odd-Even Merge Sort • Cycle Sort • Radix Sort - LSD and MSD variants • gcc's std::sort and std::stable_sort - the real implementations • Tim Sort • Block Merge Sort • Bogo Sort, Bozo Sort and Stooge Sort, for entertainment • ... and more No subscription. No ads. No analytics. No account. Just algorithms. WHO IT'S FOR • CS students learning how sorts actually compare in practice • Instructors looking for a lecture demo that's easier to launch than running g++ live • Engineers who want to rewatch a Quick Sort partition and finally see why it's fast • Anyone who finds audio-visual algorithm traces calming to watch TECHNICAL NOTES Sound of Sorting runs entirely on-device. It makes no network calls, collects no data, and has no accounts. In-app purchases are processed by Apple. — Timo Bingmann

Turing Lab is a touch-friendly environment for studying automata and formal languages on iPhone, iPad, and Mac. Create finite automata and pushdown automata, run bounded simulations, inspect step traces, minimize DFAs, and explore conversions between automata, regular expressions, and grammars. Build single-tape and multi-tape Turing machines, organize reusable machine building blocks, inspect tape execution, and analyze bounded or cyclic runs. Edit context-free and unrestricted grammars. Explore CYK, LL, LR, bounded brute-force parsing, normal forms, FIRST/FOLLOW sets, guided derivations, and supported grammar/automata conversions. Design Mealy and Moore transducers, simulate generated output, and work with L-systems through bounded rewriting, examples, and turtle rendering. Practice the Pumping Lemma for regular and context-free languages. Validate, compare, simplify, generate, and convert regular expressions. Supported workspaces provide JFLAP XML, versioned JSON, SVG, or PNG operations according to each model. Compatibility diagnostics disclose unsupported or lossy fields instead of silently discarding them. Turing Lab runs its learning workflows locally and includes offline examples. It is designed for students, educators, researchers, classroom demonstrations, lab exercises, and self-study. Turing Lab is inspired by JFLAP and supports selected compatible workflows. It is not affiliated with, endorsed by, or an official release of JFLAP, Duke University, or Susan H. Rodger.