Comparison of Various Sorting Algorithms in C++

INACTIVE PROJECT

I wrote this in the early part of 2016 when I was taking MTE 140 (Data Structures and Algorithms) at UWaterloo. Sorting code has not been substantially modified since then, although I have moved the project to CMake and added benchmarking.

Current algorithms implemented:

• Bubble Sort
• Selection Sort
• Merge Sort
• Heap Sort
• Quicksort

Running

1. Install Google benchmark
2. cmake .
3. make
4. ./SortingTestBench

Sample benchmark output:

TODO

• More efficient counting sort