PHP Two-point lookup

Binary lookup requires array ordering, efficiency is O (LOGN)

    #二分查找 functionbinarysearch(Array $arr, $target) {$low=0;$high= Count ($arr) -1; while($low<=$high) {$mid= Floor ($low+$high) /2);#找到元素if($arr[$mid] ==$target)return$mid;#中元素比目标大, find the leftif($arr[$mid] >$target)$high=$mid-1;#重元素比目标小, find the right partif($arr[$mid] <$target)$low=$mid+1; }#查找失败returnfalse; }$arr=Array(1,3,5,7,9, One);$inx= BinarySearch ($arr,1); Var_dump ($inx);?>

'). addclass (' pre-numbering '). Hide (); $ (this). addclass (' has-numbering '). Parent (). append ($numbering); for (i = 1; i <= lines; i++) {$numbering. Append ($ ('

'). Text (i)); }; $numbering. FadeIn (1700); }); });

The above describes the PHP binary search, including the aspects of the content, I hope the PHP tutorial interested in a friend helpful.

