Write a program to implement bubble sort insertion sort

Question

Problem Description

Write a program to implement bubble sort, insertion sort, selection sort, merge sort and quick sort (pivot = random index) algorithms.

a) Compute the CPU processing time for all the algorithms for varying input sizes as follows: N = 10², 10³, 10⁴, 10⁵, and 10⁶

b) Use a random number generator to generate the inputs. Obtain the inputs from the following input ranges: 1- 103, 1 - 106, 1 - 109, 1 - 1012

c) Write down your results as a table (with varying input size and algorithm type) and plot the graph. Present your inferences and/or explanations for your result (in a separate document).