Description: The goal of this assignment is to compare the
empirical complexity of two sorting algorithms: a) Heap sort and b)
Radix sort.
Instructions:
- Implement the above two sorting algorithms using Java or any
other programming language.
- Repeatedly generate random input instances containing 10, 50,
100, 500, 1000, 5000, 10000, 15000, … 50 000. The generated numbers
must be between 0 and 100.
- Execute both algorithms to sort the randomly generated
arrays.
- Compare the running time...