airiset / visual-sorter Goto Github PK

When comparing algorithms, the delay button does not work. The speed is always quick, making it hard to compare algorithms on small lists.

Currently, the canvas visualization is implemented using the asynchronous setInterval function. To make the visualization smoother and more efficient, it is recommended to implement animations using the requestAnimationFrame function.

Is there something better than visualizing a sorting algorithm? Well, of course: visualizing AND listening to a sorting algorithm! Imagine that each index of an array represents the key of an imaginary piano. It would be possible to hear a child-like tune from the many selections in a sorting snapshot.

Nitpicking a little here, but I think you can add a little margin in between the buttons just to give them some space, and it would complete the aesthetics of the page! But this is really cool and I love the compare sorting algorithms feature! Very useful in getting a visual understanding of time complexity!

Throughout development, I noticed that the bars that are sorted in the list show small gaps between them. It does not look bad for small lists, allowing us to see the differences between the bars.

However, with greater lists, the effects compound to form an ugly white band effect.

I do not like it. It has to go.

Currently it seems that the dropdown menus will not operate correctly on IOS devices, however the default settings and adjusting the dataset in size will function correctly as expected. This has been tested on iPhone XS, XS Max.

The Visual Sorter is finally past its childhood and into its long-term development stage. It is time to increase the variety of sorting algorithms implemented in our sort.js module. As a start, the following algorithms should be implemented into the sort.js library,

• - Heap Sort
• - Sample Sort (var. Quicksort)
• - Shell Sort (var. Insertion Sort)
• - Gnome Sort (var. Insertion Sort)
• - Cocktail Sort (var. Bubble Sort)

Each new algorithm should following the inheritance structure of the Sorter family of classes. If an algorithm is a variant of an already created algorithm, it should inherit from it. For example, Cocktail Sort is a variant of Bubble Sort, so the class that implements it should inherit from Bubble Sorter. The variant algorithms in this list are marked with a (var.).