二分查找

最新推荐文章于 2023-12-11 00:13:40 发布

qq_39706019

最新推荐文章于 2023-12-11 00:13:40 发布

阅读量172

点赞数

分类专栏：博客文章标签：其他

本文链接：https://blog.csdn.net/qq_39706019/article/details/81357399

版权

博客专栏收录该内容

114 篇文章 0 订阅

订阅专栏

本文参考自: 原文地址

 
  package 
  cn.chen.tree; 
 
  public class 
  BS { 
 
  public int 
  bs(Integer key, 
  int 
  low, 
  int 
  high){ 
 
  if 
  (low > high) 
  return 
  low; 
 
  int 
  mid = low + (high - low) / 
  2 
  ; 
 
  int 
  cmp = 
  key.compareTo(mid); 
 
  if 
  (cmp > 
  0 
  ) 
  return 
  bs(key, mid + 
  1 
  ,high); 
 
  else if 
  (cmp < 
  0 
  ) 
  return 
  bs(key, low,mid - 
  1 
  ); 
 
  else return 
  mid; 
 
      } 
 
  public int 
  bs2(Integer key, 
  int 
  low, 
  int 
  high){ 
 
  int 
  lo = low; 
 
  int 
  hi = high; 
 
  while 
  (low <= high){ 
 
  int 
  mid = lo + (hi - lo) / 
  2 
  ; 
 
  int 
  cmp = 
  key.compareTo(mid); 
 
  if 
  (cmp > 
  0 
  ) lo = mid + 
  1 
  ; 
 
  else if 
  (cmp < 
  0 
  ) hi = mid - 
  1 
  ; 
 
  else return 
  mid; 
 
          } 
 
  return 
  lo; 
 
      } 
 
  public int 
  bs3(Integer key, 
  int 
  [] arr){ 
 
  int 
  lo = 
  0 
  ; 
 
  int 
  hi = arr. 
  length 
  ; 
 
  while 
  (lo <= hi){ 
 
  // 下标 
 
  int 
  mid = lo + (hi - lo) / 
  2 
  ; 
 
  int 
  cmp = 
  key.compareTo(arr 
  [mid]); 
 
  if 
  (cmp > 
  0 
  ) lo = mid + 
  1 
  ; 
 
  else if 
  (cmp < 
  0 
  ) hi = mid - 
  1 
  ; 
 
  else return 
  mid; 
 
          } 
 
  return 
  lo; 
 
      } 
 
  }