Question

I know about Arrays.deepEquals(Object[], Object[]) but this doesn’t work for primitive types (due limitations of arrays and autoboxing, see this related post).

With that in mind, is this the most efficient approach?

boolean byteArrayEquals(byte[] a, byte[] b) {     if (a == null && b == null)         return true;      if (a == null || b == null)         return false;      if (a.length != b.length)         return false;      for (int i = 0; i < a.length; i++) {         if (a[i] != b[i])             return false;     }     return true; } 

Answer 1

Change your first comparison to be:

if (a == b)     return true; 

This not only catches the ‘both null’ cases, but also ‘compare an array to itself’ case.

However, for a simpler alternative – use Arrays.equals which has overloads for each primitive type. (The implementation is very similar to yours, except it hoists the array length out of the loop. On .NET that can be an anti-optimization, but I guess the JRE library implementors probably know better for the JVM 🙂