The task is to conduct benchmarking to compare seven sorting algoritms: bubble sort,

selection sort, insertion sort, merge sort, quicksort, shellsort, and heapsort. Each of the

algorithms need to be run with random data sets of $25,00075,000120,000350,000$

$500,000$ distinct items, $5$ times each, averaged. To ensure proper distribution, the random

data sets are to be selected from a range of $3,000,000$ items. These data sets are to be

placed in different files, based on the number of items in each file.

All algorithms are to be tested with the same data sets.