二分查找

package com.demo;


public class Test1 {
public static void main(String args[]) {
binarySearch(8);
System.out.println(binarySearch(8));
}
public static int binarySearch(int value){
int[] arr  = new int[]{1,2,3,4,5,6,7,8,9,10};

   int middle = 0;
   int low = 0;
   int high = arr.length - 1;
   
   while(low <= high){
       middle = (high+low)/2;
       if(arr[middle]==value){
           return middle;
       }
       if(arr[middle] > value){//中间值比较大，往左边找
           high  = middle - 1;
       }else{//往右边找
           low = middle + 1;
       }
   }
   return -1;
}
}