Java efficiency (Calling method)

Question

I'm writing a method that finds intersection of given arrays .

Since I had to iterate both arrays , I was thinking of using

if(arr2.length > arr1.length){
     intersection(arr2, arr1);
}

The reason I came up with this idea was that it seemed to me to be the better way to reduce the length of code for handling arrays that have different length.

As a newbie to programming, I'm wondering if there is any other suggestion.

Answer 1

Put your array in a list:

List a = List.asArray(arr1);

(ref: https://docs.oracle.com/javase/7/docs/api/java/util/Arrays.html#asList(T... )

And use the suggestion here to find the intersection:

How to do union, intersect, difference and reverse data in java