Coding Language: MIPS Write a \"merge\" program that merges two ordered lists of

Question

Coding Language: MIPS

Write a "merge" program that merges two ordered lists of integers into a new ordered list.

For example, given two ordered lists (9,6,4,1) and (7,3,2,0) as input arguments, "merge" should produce a new list (9,7,6,4,3,2,1,0) which is also ordered. Another example could be to merge (6,0,-3) and (9,5,4,0,-2) to produce (9,6,5,4,0,0,-2,-3).

The "merge" program assumes that the two input lists (in decreasing order) of integers are stored in the data area. It loads the integers and merges them into an ordered list. The resulting ordered list (e.g. (9,6,5,4,0,0,-2,-3)) should be stored back into the data area.

It is at your own choice how the data area (i.e. the lists) is arranged, and whether the resulting list is overwritten onto the original two lists. But be sure to give meaningful labels and clearly indicate (using label or comments) where the merged list is stored. Before your program terminates, it should print out the merged list which should be in decreasing order.

do NOT implement any sorting algorithm!

Explanation / Answer

import java.util.*; class merge { // Data Area //static LinkedList list1 = new LinkedList(Arrays.asList(9,6,4,1)); //static LinkedList list2 = new LinkedList(Arrays.asList(7,3,2,0)); static LinkedList list1 = new LinkedList(Arrays.asList(6,0,-3)); static LinkedList list2 = new LinkedList(Arrays.asList(9,5,4,0,-2)); static LinkedList list3 = new LinkedList(); // Code Area public static void main(String[] args) { ListIterator list1Iterator = list1.listIterator(); ListIterator list2Iterator = list2.listIterator(); Integer i1 = list1Iterator.next(); Integer i2 = list2Iterator.next(); while (true) // endless, breaks when one of the list reaches its end { if (i1 > i2) { list3.add(i1); if (list1Iterator.hasNext()) { i1 = list1Iterator.next(); } else // no element left in list1, fill list3 with the rest of list2 and break { list3.add (i2); while (list2Iterator.hasNext()) { list3.add(list2Iterator.next()); } break; } } else { list3.add(i2); if (list2Iterator.hasNext()) { i2 = list2Iterator.next(); } else // no element left in list2, fill list3 with the rest of list1 and break { list3.add (i1); while (list1Iterator.hasNext()) { list3.add(list1Iterator.next()); } break; } } } System.out.println (list3); } } // class merge

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---