Question:
Sorting Algorithms Comparison
We have considered the following sorting algorithms in this book:
Heap, Insertion, Merge, Quicksort, Radix, Selection
For each sort, give the average and worst case running time and the space requirements, and make some additional comments about the efficiency of the algorithm. The additional comments may specify how probable the worst case is, the number of interchanges performed by the algorithm, and special situations that make the algorithm run faster