Answer Happy

One of the variations on a merge operation is to eliminate any duplicates whlie performing the merge. So the resulting merged array may be shorter than the sum of the lengths of the origina arrays. We will assume though, that the two input arrayLists of Objects each are unique, but sorted of course. The merge below uses ArrayLists (like Python lists) so we use the get() and add methods for array access. public static ArrayList mergeUnique (ArrayList a, ArrayList b) { int i = 0; int j = 0; int cmp; ArrayList m = new ArrayList; while (i < a.size() && . O if ((c = .get(i).compareTo( .get >))==0){ i++; // skip a duplicate } else if ( < 0){ m.add .get(i++)); } else { m.add( .get(j++)); } } 1/ copy remaining elements over while (i < 0) m.add(a. ++)); while (< . 0) m.add(a. ++)); return ; }