VSort is a sorting algorithms visualizer that allows you to interactively explore and compare different sorting algorithms' behaviors on various data distributions.
VSort currently supports the following sorting algorithms:
- Bubble Sort
- Insertion Sort
- Selection Sort
- Heap Sort
- Merge Sort
- Quick Sort
With VSort, you can:
- Select a sorting algorithm to visualize
- Observe real-time step-by-step execution of the algorithm
- Control the algorithm's progress with step forward and step backward options
- Choose the initial array size for sorting
- View customized visualizations for each algorithm
- Select the initial distribution of elements in the array
- Adjust the visualization speed
- Visit the VSort website: marcofratta.github.io/PPS-22-VSort/
- Explore the interactive visualizations by selecting your preferred sorting algorithm and data distribution.
Enjoy exploring the behaviors of different sorting algorithms in action!