farbfetzen / algorithms Goto Github PK

SortingAlgorithmRunner.run and SortingAlgorithmRunner.visualize both generate random points in different ways. Only do that once before calling those methods.

E.g. the books on algorithms that I bought.

Work towards implementing the Voronoi diagram from Chapter 9 "Computational Geometry".

like JCommander.

Instead use System.out. And catch errors in the main method and only print the message with System.err. Make a new command line argument to control if the full stacktrace should also be printed. Use logging only for development and debugging purposes.

This way I don't have to write twice the code. This makes the algorithms a bit less efficient but I don't really care about that. The main goal of this project is the visualisation.
Do the recording and the mutation in the same method, if possible. For example the swap can be done at the same time without writing two lines all the time. And operate on an instance array instead of passing the array around.
And streamline the recording a bit. Maybe something like recorder.newStep().swap(i, j).highlight(i, j).record(); where recorder is an instance variable that has access to the array and does the swapping during the swap() call.
This also means I need to create a Recorder class that is separate from the StepWiseSorter class, which would be good practice anyway.

Make visualisation mode the default and create a command line argument to disable it.

• List the available command line arguments
• List the keybindings for the visualisation
• List the implemented algorithms