二分查找算法递归实现

桃扇骨 2022-05-21 07:52 297阅读 0赞 
  1. /** * Created by panjiannan on 2018/7/3. */
  2. public class BinarySearch { 
  3.     public static void main(String[] args) {
  4.         int[] array = {
  5.    1,2,3,6,8,9};
  7.         System.out.println(binarySearch(array, 8));
  8.     }
  10.     private static int binarySearch(int[] ary, int target) {
  11.         return binarySearch(ary, 0, ary.length -1, target);
  12.     }
  14.     private static int binarySearch(int[] ary, int fromIndex, int toIndex, int target) {
  15.         if (ary.length == 0 || fromIndex > toIndex) {
  16.             return -1;
  17.         }
  18.         int mid = (fromIndex + toIndex) >>> 1;
  19.         if (target == ary[mid]) {
  20.             return mid;
  21.         }
  22.         if (target < ary[mid]) {
  23.             return binarySearch(ary, fromIndex, mid -1, target);
  24.         }
  25.         if (target > ary[mid]) {
  26.             return binarySearch(ary, mid + 1, toIndex, target);
  27.         }
  28.         return -1;
  29.     }
  30. }

发表评论

表情：
评论列表 （有 0 条评论，297人围观）

还没有评论，来说两句吧...

相关阅读