21 Sorting Algorithms Visualized (50,000 Elements) - Swirl Dots

21 sorting algorithms vs. 50,000 elements, drawn as a swirl of dots Timestamps: 00:00 Quicksort (Dual Pivot) 00:23 Merge Sort 00:46 Heap Sort 01:09 Radix LSD Sort (Base 10) 01:32 Quicksort (Middle Pivot) 01:55 Cycle Sort 02:24 Selection Sort 02:47 Gnome Sort 03:34 Shell Sort 03:57 Gravity Sort 04:21 Counting Sort 04:44 Double Selection Sort 04:57 Insertion Sort 05:20 Odd Even Sort 06:14 Comb Sort 06:37 Bubble Sort 07:31 Shaker Sort 08:24 Bucket Sort 08:47 American Flag Sort 09:10 Pigeonhole Sort 09:33 Tim Sort -------------------------------------------------- COMMON QUESTIONS Q: How does this visualizer work? A: Each of the 50,000 elements is a dot. Its position in the array sets the angle, and its value sets the distance from the center. A shuffled array looks like a scattered cloud. As the algorithm sorts, the dots line up into a clean, smooth swirl. 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.