1. Write a program that obtains the execution time of selection sort, merge sort, quick sort, heap sort, and radix sort for input size 50,000, 100,000, 150,000, 200,000, 250,000, and 300,000. You can assume the range of the numbers are [0, 100000). Your program should create data randomly and print a table like this: Array Selection Size Sort 10000 38 20000 142 30000 121 40000 217 50000 330 60000 479 Merge Sort 3469 11 18 Quick Sort 222356 Heap Sort 24 7 7 9 13 14 Radix Sort 10 13 3 5 7 6

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.