Sorting 46,656 Cubes

Disparity Cube Visualizer - Random shuffle Timestamps: 00:16 Quick Sort (Middle Pivot) 00:35 Merge Sort 00:54 Heap Sort 01:12 Radix Sort (LSD) (Base 10) 01:30 Shell Sort 01:49 Cycle Sort 02:07 Selection Sort 02:47 Gnome Sort 03:06 Gravity Sort 03:24 Counting Sort 03:34 Double Selection Sort 03:52 Insertion Sort 04:39 Odd Even Sort 04:58 Comb Sort 05:44 Bubble Sort 06:02 Quick Sort (Dual Pivot) 06:48 Shaker Sort 07:06 Bucket Sort 07:24 Pigeonhole Sort 07:43 Tim Sort -------------------------------------------------- COMMON QUESTIONS Q: How does this visualizer work? A: Array elements are placed as boxes on a 3D cubic lattice. Each box’s size shows disparity (how misplaced the item is): sorted elements grow to full size; misplaced ones shrink toward the center of their cell. As sorting progresses, the lattice fills out into a solid rotating cube. Q: How was this built? A: Built in Java as a custom, open-source tool featuring 20+ algorithms and 30+ visual modes (including 3D). Source code: https://github.com/66-m/sorting-visua... Q: Why do algorithms take so long? A: Delays are added intentionally so the process is visible. In reality, these algorithms take milliseconds. Displayed times aim to sum actual operation times, though visualization overhead adds slight variance.