20+ Sorting Algorithms - Disparity Circle
The Disparity Circle Visualizer was improved to support more elements!
Common Questions:
Q: How does this visualizer work?
A: The Disparity Sphere Visualizer: Each line gets closer to the centre of the sphere the further away it is from its original position: Original position = line has maximum length.
Q: How was this done?
A: I've written a sorting algorithm visualizer in Java. It is quite customisable and contains over 20 algorithms and visualizers. It is open source and available for free on my GitHub: https://github.com/CompilerStuck/sort...
Q: Why does algorithm xy take so long?
A: It is a trade-off between visualising the process and being accurate in measurements. These sorting algorithms are done with sorting in a few milliseconds. I've added delays between operations to visualise the process. Calculating the estimated real time it takes an algorithm to complete may not be correct, as I try to record and sum up the actual time it takes the algorithms to complete the sorting. (And my code might have bugs, oops)
Q: Are there plans to expand or update the visualizer?
A: I am continuously looking for ways to improve and expand the visualizer. Future updates may include adding more sorting algorithms, enhancing the visual aesthetics, and incorporating more interactive features. I also consider feedback from the community. Stay tuned for updates on my GitHub page.
Like this video, if you enjoyed :)
Timestamps:
00:00 Quick Sort (Middle Pivot)
00:18 Radix Sort (LSD) (Base 10)
00:42 Merge Sort
01:34 Heap Sort
02:27 Quick Sort (Dual Pivot)
03:07 Shell Sort
03:57 Odd Even Sort
04:41 Shaker Sort
06:27 Tim Sort
07:14 Bubble Sort
08:43 Selection Sort
09:08 Double Selection Sort
09:23 Insertion Sort
09:49 Cycle Sort
10:12 Counting Sort
10:31 Comb Sort
11:05 Gnome Sort
11:52 Bucket Sort
12:04 American Flag Sort
12:29 Pigeonhole Sort
12:42 Bogo Sort