摘要：二分查找法 function binarySearch($arr, $val, $hight, $low = 0) { $i = 0; while ($low <= $hight) { $i++; $mid = ceil($low + ($hight - $low) / 2); if ($arr[$
阅读全文
|
|
随笔分类 - 算法学习
摘要：二分查找法 function binarySearch($arr, $val, $hight, $low = 0) { $i = 0; while ($low <= $hight) { $i++; $mid = ceil($low + ($hight - $low) / 2); if ($arr[$
阅读全文
|
