A web application called Sorting Visualizer allows users to see a variety of sorting methods, including
Sort by Selection. Bubble Sort. Sort by Insertion. Sort by Merge. Sort quickly. Sort by heap. With the capabilities of π (Array Size Control) and β³ (Processing Speed Control),
β How does it work? _In this model, the algorithms sort the elements by putting the largest elements on the right and the smallest on the left. Each element value is represented by THE SIZE OF THE BAR.
You can try it out in the live demo here:https://akhand55.github.io/sorting-visualizer/