Implement BubbleSort and MergeSort and save them as bubble and merge. Test the running times of your implementations on randomly(!) generated integer sequences of size n = 10, 100, 1,000, and 10,000. Run every test 10 times and average the results.
Be sure to only include the time needed for sorted, excluding the time to generate the random numbers. Plot the results (input size, running time) for BubbleSort and MergeSort.
In the same graph, plot the time complexity according to theoretical bounds.
Include the code to calculate the time in the program.