21 Sorting Algorithms Visualized (50,000 Elements) - 3D Sphere

21 sorting algorithms vs. 50,000 elements on a 3D Sphere Timestamps: 00:04 Merge Sort 00:17 Quick Sort (Middle Pivot) 00:30 Heap Sort 00:44 Radix Sort (LSD) (Base 10) 00:57 Shell Sort 01:13 Cycle Sort 01:26 Selection Sort 02:14 Gnome Sort 02:28 Gravity Sort 02:41 Counting Sort 02:49 Double Selection Sort 03:03 Insertion Sort 03:58 Odd Even Sort 04:11 Comb Sort 05:06 Bubble Sort 05:20 Quick Sort (Dual Pivot) 06:14 Shaker Sort 06:27 Bucket Sort 06:40 American Flag Sort 06:53 Pigeonhole Sort 07:07 Tim Sort -------------------------------------------------- COMMON QUESTIONS Q: How does this visualizer work? A: Points are plotted on the surface of a sphere. Each array index maps to a fixed grid position on the sphere (points wrap around in latitude/longitude order), while distance from the center shows disparity (how misplaced the item is). Sorted elements sit out on the sphere's outer surface; misplaced ones pull in toward the center. As sorting progresses, points push outward until they form a full, solid sphere. The whole thing rotates continuously for a 3D view of the process. 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.