I just built a Python visualizer for sorting algorithms! This program helps students learn sorting algorithms through real-time visualization. There are 9 different sorting algorithms (Bubble Sort, Merge Sort, Quick Sort, and more) that show how each algorithm processes data step-by-step. Each comparison and swap can be seen in real time, with color-coded highlights to help distinguish events. Another feature is the performance analysis that can run multiple algorithms side-by-side to see how their execution times scale with data size. This allows us to make Big O notation tangible and showcasing the difference in speed between algorithms. I'd like to thank Yair Diaz and Brandon Li for helping out! #CSUF
In your performance analysis, how do you ensure that execution times are measured fairly across algorithms?
How did you decide which nine sorting algorithms to include, and do you think any important ones are missing?
Wow!! So insighful !!
#gotitans!!
Business Finance w/ Applied Analytics Minor at University of Southern California
1moWhat specific learning challenges for students does your visualizer solve that existing tools or textbooks don’t?