Home >Backend Development >PHP Tutorial >Example explanation of PHP implementation of array search function based on binary method
This article mainly introduces PHP to implement the array search function based on the binary method, and analyzes the related implementation techniques of while loop and recursive calling algorithm to implement the binary search function in the form of examples. Friends in need can refer to it
The example in this article describes how PHP implements the array search function based on the binary method. Sharing it with everyone for your reference, the details are as follows:
Dichotomy. Use the while loop method and the recursive calling method respectively.
<?php // 二分法的使用数组必须是有序的,或升序,或降序 $arr = array( 1, 3, 5, 7, 9, 13 ); // 递归调用(相比较好理解 function bsearch_r($v, $arr, $low, $high){ if ($low > $high) {// 先判断结束条件 return -1; } $i = intval(($high + $low)/2); if ($arr[$i] > $v){ return bsearch_r($v, $arr, $low, $i-1);// 递归 } else if ($arr[$i] < $v){ return bsearch_r($v, $arr, $i+1, $high); } else { return $i; } } echo bsearch_r(1, $arr, 0, count($arr)-1);// 0 echo '<hr/>'; echo bsearch_r(14, $arr, 0, count($arr)-1);// -1 echo '<hr/>'; // while循环 function bsearch($v, $arr){ $low = 0; $high = count($arr)-1;// 使用下标,注意减去1 // 注意凡是使用到while的时候,一定要防备无限循环的时候,注意终止循环的判断。 while($low <= $high){// 比如$low<=$high,这个等于号必须有。 $i = intval(($high + $low)/2); if ($arr[$i] > $v){ $high = $i-1; } else if ($arr[$i] < $v){ $low = $i+1; } else { return $i; } } return -1;// 找不到的时候返回-1 } echo bsearch(13, $arr);// 5 echo '<hr/>'; echo bsearch(14, $arr);// -1
Run results:
##Articles you may be interested in:Detailed explanation of classes and objects in PHP
Explanation of PHP single file and multiple file upload examples
Principle Analysis of PHP Multiplayer Module Development
The above is the detailed content of Example explanation of PHP implementation of array search function based on binary method. For more information, please follow other related articles on the PHP Chinese website!