Question

10 L 1 22 Given the function below, that divides the original array in two arrays of half size, develop the Java code that combines two sorted arrays or clearly explain how to implement the merge function. (3 points) nt middle values.Length/2; // divide array into two arrays of half size nt left- new int[middle]; or Cint i-e; imiddle; i+) t Leftri] - values[iJ: ntD right- new int[values. length-middle]: or Cint i-a; i<values.length-middle; i++) t rightli] -values [middle+i]; ort(left); //recursively call sorting function on each smaller array ortCright); swer the following three questions: What is the overall time complexity of Merge ur answers in big O notation. Is Mergesort in place? Is Mergesort stable? (4 poin

Answer 1

a) Binary  Min Heap:

Step 1: Insert keys 7 & 8        

7 8

Step 2: Insert key 9          

7 89
                 

Step 3: Insert key 12

9 7 8

Step 4: Insert key 13

7 8 9 12) (13

Which is Required Binary  Min Heap

b) Delete Minimum (i.e 7 )

8 12 13

Delete Minimum (i.e 8 )

12) (13

c) Insert key 4:

4 13 9 12

Insert key 3:

4 13 12) 9

Which is Required Binary  Min Heap

Answer 2

a) Binary  Min Heap:

Step 1: Insert keys 7 & 8        

7 8

Step 2: Insert key 9          

7 89
                 

Step 3: Insert key 12

9 7 8

Step 4: Insert key 13

7 8 9 12) (13

Which is Required Binary  Min Heap

b) Delete Minimum (i.e 7 )

8 12 13

Delete Minimum (i.e 8 )

12) (13

c) Insert key 4:

4 13 9 12

Insert key 3:

4 13 12) 9

Which is Required Binary  Min Heap