Description: Implement algorithms QuickSort, InsertionSort, SelectionSort, MergeSort and HeapSort and. Test your implementation according to the following requirements:
(1) Let n=10000, 20000,30000,..., 100000. For each input size n. Please test 100 groups of input data and compare the average running time of your selected algorithms for each n. The data can be generated using pseudo-random functions.
(2) Let n=10000, 20000,30000,..., 100000. For each input size n, take 100 sequences arranged in non-decreasing order and in decreasing order as input data, respectively. Compare the running time of these algorithms respectively.
To Search:
File list (Check if you may need any files):
main.cpp
sort.h
Download