The Cubic Lines Visualizer - first time in action!
Common Questions:
Q: How does this visualizer work?
A: The Cubic Lines Visualizer displays a 1 dimensional array onto a cube. The elements draw a circle, if they are at their correct spot. A line gets drawn from the elements original (true) position to its current (false) position.
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: github.com/CompilerStuck/sorting-visualizer
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:17 Radix Sort (LSD) (Base 10)
00:40 Heap Sort
01:31 Merge Sort
02:25 Cycle Sort
02:33 Shell Sort
03:30 Pigeonhole Sort
03:43 Odd Even Sort
04:25 Quick Sort (Dual Pivot)
05:08 Selection Sort
05:34 Double Selection Sort
05:49 Insertion Sort
06:16 Counting Sort
06:34 Comb Sort
07:12 Gnome Sort
07:58 Bubble Sort
09:11 Shaker Sort
10:35 Bucket Sort
10:48 American Flag Sort
11:14 Tim Sort