Question: STAGE 1 | MergeLists.java (Merge two sorted lists) Write the following method that merges two sorted lists into a new sorted list. public static int[]

STAGE 1 | MergeLists.java (Merge two sorted lists) Write the following method that merges two sorted lists into a new sorted list. public static int[] merge(int] list1, intl] list2) Implement the method in a way that takes at most list1.length + list2 length comparisons. Write a test program that does the following: 1) Input list1 size 2) Int[] list = generateListlisti-size) // (1.20 inclusive) 3) Sort list1 4) printList(list1) 5) Input list2_size 6) Intl list2 - generateList(list2_size) (1-20 inclusive) 7) Sort list2 8) printList(list2) 9) Intl result - merge(list1, list2) /i merge without using sorting 10) printList(result)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
