[JavaScript] JavaScript通过二分查找算法在数组中查找数据 →→→→→进入此内容的聊天室

来自 , 2019-11-10, 写在 JavaScript, 查看 130 次.
URL http://www.code666.cn/view/b0eb9a95
  1. var Arr = [3,5,6,7,9,12,15];
  2. function binary(find,arr,low,high){
  3. if(low <= high){
  4. if(arr[low] == find)
  5. return low;
  6. if(arr[high] == find)
  7. return high;
  8. var mid = Math.ceil((high + low)/2);
  9. if(arr[mid] == find){
  10. return mid;
  11. }else if(arr[mid] > find){
  12. return binary(find,arr,low,mid-1);
  13. }else{
  14. return binary(find,arr,mid+1,high);
  15. }
  16. }
  17. return -1;
  18. }
  19. binary(15,Arr,0,Arr.length-1);
  20. //javascript/7678

回复 "JavaScript通过二分查找算法在数组中查找数据"

这儿你可以回复上面这条便签

captcha