Binary Search

public static int BinarySearch( int[] array, int target )
{
    int min = 0;
    int max = array.length - 1;

    while (min != max)
    {
        int mid = ( min + max ) / 2;
        if ( array[ mid ] == target )
            return mid;
        else if ( array[ mid ] > target )
            max = mid - 1;
        else if ( array[ mid ] < target )
            min = mid + 1;
    }
    return -1;
}