您好,欢迎来到三六零分类信息网!老站,搜索引擎当天收录,欢迎发信息

php实现二分查找算法

2025/6/28 4:07:18发布17次查看
// $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 { return binarysearch( $array, $key, $low, $middle-1 ); } return binarysearch( $array, $key, $middle+1, $high ); // our key might be in the right sub-array}
复制代码
php
该用户其它信息

VIP推荐

免费发布信息,免费发布B2B信息网站平台 - 三六零分类信息网 沪ICP备09012988号-2
企业名录 Product