Sorting Algorithms

Note: This software requires a Java environment.

This software was developed with the aim of enriching teaching and learning in the area of sorting algorithms with new possibilities. It visualizes the selected sorting algorithm by performing the sort on a user-defined number sequence and displaying a protocol of the sorting steps.

Sorting Algorithms is licensed under the terms of GPL v3 and may therefore be used and distributed freely. If you are interested in improving the software, feel free to contact me with your ideas — or, as a developer, create a pull request on GitHub.

At this point, I want to thank Dr. Klaus-J. Förster and René Goertz, who allowed me to develop this as a university project and contributed to its success through feedback and proposals.

The project is technically my oldest publicly available project. It started as a university project during my bachelor studies (2015) and was later forked into sorting-algorithms, a project available here.

I decided to maintain sorting-algorithms as a separate project with the clear goal of covering sorting algorithms only. Updates to sorting-algorithms are not reflected in teaching-algorithms, which has not received any updates since 2016.

Currently Supported Algorithms

Bubblesort
Selectionsort
Radixsort
Quicksort
Heapsort (Min-/Max-heap)
Insertionsort
Shellsort
Missing something? Let me know

Noteworthy Features

Single-step execution
Visual representation of sorting algorithms as a protocol
Generation of random numbers for sorting tasks
LaTeX export