A variation of merge sort involves calling a bubble or insertion sort when we reduce to an array size that is small – say less than 50.   Rewrite the merge sort so that if the array partition we are looking at has a size less than 50, call insertion sort on that partition.  Then using System.nanotime for a rough estimate and using random Integer arrays of Various Sizes (N) indicate how efficient the two sorts are using the following table to record your results.  Also include estimates for the time it would take to this using a bubble sort.

Include all the necessary methods to complete this task in a class file called Sort Question

 

Transcribed Image Text:

N 1000 10000 100000 1000000 10000000 Merge Sort Modified Merge Sort Bubble Sort Insertion Sort N 1000 10000 100000 1000000 10000000 Merge Sort Modified Merge Sort Bubble Sort Insertion Sort

Answer rating: 100% (QA)

I cannot answer the question in the image because it is incomplete and does not provide enough infor... View the full answer