Find min of 3 numbers hardcoded
For these things we have java.lang.Math:

public static int min(final int a, final int b, final int c){
    return Math.min(a, Math.min(b, c));
}


Wow, look how short it is!

But it's 3 numbers today, it's 10 tomorrow.
As an alternative, how about an array?

public static int min(int... numbers){
    if (numbers.length == 0){
        throw new IllegalArgumentException("Can't determine smallest element in an empty set");
    }
    int smallest = numbers[0];
    for (int i = 1; i &lt; numbers.length; i++){
        smallest = Math.min(smallest, numbers[i]);
    }
    return smallest;
}


I'd use the java.lang.Math solution, it's very short, and very readable.