| |
L.A.25.1 - Merge | page 8 of 9 |
Assignment:
As explained in the student outline, write a method to merge two sorted lists into one sorted list.
Add the code for your merge method to the provided merge template program, MergeTemplate.java.
Instructions:
The merge algorithm is prone to logic errors. The most common error is dealing with cases when you have reached the end of one list or the other. You are to test these 6 different input scenarios:
List A List B
Quantity Largest Value Quantity Largest Value
Trial 1 20 100 40 100
Trial 2 40 100 20 100
Trial 3 20 100 40 50
Trial 4 20 50 40 100
Trial 5 40 50 20 100
Trial 6 40 100 20 50
Submit your source code and the printed run output for trials 4 and 6 . If possible, print only the merge function source code.
|