private Comparator<Integer> c = (i, j) -> i - j;
When I used this implementation when writing unit tests for a Data Structures assignment (implementing a heap), much to my surprise the results were rather buggy. I was generating random integers and throwing them in the heap, followed by checking the heap property. When I replaced this implementation with the following alternative, everything worked perfectly:
private Comparator<Integer> c = (i, j) -> i < j ? -1 : i > j ? 1 : 0;
So what's the difference? Overflow. Imagine i = 2135909750 and j = -21314406. The subtraction yields -2137743140, which, being negative, is not exactly the desired result. Of course, with roles reversed underflow is also a hazard.
The lesson for me today is that sometimes, when trying to be clever and succinct, don't be too clever!
