Answer Happy

Please upload your .Doc document here as well as on digication (MAC281 class and make a deposit) The project is to compare sorting algorithms. Consider three algorithms: bubble sort, insertions sort and merge sort. You need to perform at least 10 experiements for each and compute the average time it takes to sort a large array of random integers. Write a little paragraph with the results in doc document. Example how to proceed. . procedure test Total Time = 0; for n = 1 to 10 do Generate a large number of randon numbers example an array of 1 million integers. (integers between -1 billion to +1 billion) record startTime call the sorting procedure to sort your array (bubblesort ot insertion sort or Merge sort) record end Time TotalTime += endTime - startTime END loop Average Time = TotalTime/10.0; Do this for each algorithm. Gather the results, write a small document about your findings.