vberthet / campus-num-visual-sort Goto Github PK

When working with merge sort, having only the swap operation is very limiting and degrade a lot the performance of the algorithm.

We should provide a option similar to splice that clone a part of the array.
Then the students will have the ability to merge the array in a easier and more natural way.
At the end of merging provide a function to copy back the cloned array to the top array.

The view should also display the cloned section on transparent over the top array to visualize the merging process.

Verify that the algorithm has correctly sorted the array.
In case of success paint in green otherwise paint in red.

Currently we only draw the last swapped items.
We should also draw a marker for the the last compared items.

When the number of items is to high the panel doesn't draw anything.
In fact in that case the with of the bar in lower than 1 pixel.

In addition due to rounding, some of the last element could be drawn outside of the panel.

Currently the array is fully random.

We should provide a way to generate :

nearly sorted arrays
nearly reversed sorted arrays

Allow the user to change the sleep time when the algorithm is running.

Improve thread structure, it done quite badly in the current implementation.

The sorting algorithm keeps running when the sorting window is closed.
The windows can't redraw if we remove the pause inside the swap method.

Solution, the sorting should append in an separate thread and must be stopped when the windows is closed.