Data Calculations
Good luck
Middle,index,index,thumb,middle
So in the beginning, a regular computer took up the space of an entire room it was literally that big in size. now and days computers are this small object that you can carry around with you in your bag.
Answer:
(Assuming Java)
public ArrayList diff(ArrayList list1, ArrayList list2) {
ArrayList<Integer> union = new ArrayList<>();
for (int element : list1) {
union.add(element);
}
for (int element : list2){
if (!union.contains(element)) {
union.add(element);
}
}
return union;
}
Explanation:
Create an ArrayList that has the union of list1 and list2.
First for loop copies all elements into the union array list.
Second for loop adds all elements that are not yet in the union arraylist to the union arraylist.
(Keep in mind that I assume that you mean a mathematical union, so no duplicates. If this is not what you mean, remove the if statement in the second for loop)
This is in fact false to my knowledge
