Home

This is a benchmarking suite for different sorting algorithms on numerical values. It is also a nice benchmark for compilers as those algorithms react differently on various optimization options and capabilities.

The motivation for this project is, to build a plattform for people interested in comparing sorting algorithms (assumingly students). The problem is, that you need to write the time measurement, data generation and evaluation for each and every algorithm over and over again. This framework centralizes this in a single extensible component.

The algorithms, that are already included, are:

• Bubble sort
• Combsort
• Counting sort
• Heapsort
• Insertion sort
• Merge sort
• Min-max sort
• Quicksort
• Radix sort
• Selection sort
• Shellsort
• Stooge sort
• Tree sort