PHP如何编写二分查找算法代码？

本文共计147个文字，预计阅读时间需要1分钟。

python// +$low 和 +$high 必须是整数function BinarySearch($array, $key, $low, $high) { if ($low > $high) { // 终止情况 return -1; } $middle=intval(($low + $high) / 2); // 获取数组中间位置 if ($array[$middle]==$key) { return $middle; } if ($array[$middle] > $key) { return BinarySearch($array, $key, $low, $middle - 1); } else { return BinarySearch($array, $key, $middle + 1, $high); }}

// $low and $high have to be integers function BinarySearch( $array, $key, $low, $high ) { if( $low > $high ) // termination case { return -1; } $middle = intval( ( $low+$high )/2 ); // gets the middle of the array if ( $array[$middle] == $key ) // if the middle is our key { return $middle; } elseif ( $key < $array[$middle] ) // our key might be in the left sub-array { return BinarySearch( $array, $key, $low, $middle-1 ); } return BinarySearch( $array, $key, $middle+1, $high ); // our key might be in the right sub-array }