Find min of 3 numbers hardcoded public static int min(int a, int b, int c)
{
    int result = 0 ;
    if( a &lt; b &amp;&amp; a &lt; c &amp;&amp; b &lt; c) result = a ;
    else if( a &lt; b &amp;&amp; a &lt; c &amp;&amp; b &gt; c) result = a ;

    else if( a &gt; b &amp;&amp; a &lt; c &amp;&amp; b &lt; c) result = b ;
    else if( a &lt; b &amp;&amp; b  &gt; c &amp;&amp;  c &lt; a) result = c ;

    else if( a &gt; b &amp;&amp; b &lt; c &amp;&amp; a &gt; c) result = b ;
    else if( a &gt; b &amp;&amp; a &gt; c &amp;&amp; c &lt; b) result = c ;
    return result ;
}


Is it better than nested if statements?  Is there a more readable solution than this? To me it looks pretty readable, but I'm not sure whether it can be improved.
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.