In this project, a run-time comparative analysis is presented. It consists in evaluating the run-times of four well-known sorting algorithms:
Insertion Sort, Heap Sort, Quick Sort & Counting Sort .