Cacher is the code snippet organizer for pro developers

bool BinSearch( float P[ ], float K, int i, int j ) 
{
     if ( j - i <= 0 )
        if ( i == j && P[ i ] == K ) 
           return true;
        else
            return false;
     else 
     {
         int k = ( i + j ) / 2;
         if ( P[ k ] > K )
            return BinSearch( P, K, i, k - 1 );
         if ( P[ k ] == K )
            return true;
         if ( P[ k ] < K )
            return BinSearch( P, K, k + 1, j );
     }
}