java二分法查找

<span style="font-size:24px;">/*
* 功能：java二分查找
* */
package Shuzu;

public class chazhao {

public static void main(String[] args) {
// TODO Auto-generated method stub
int [] arr={2,5,6,9,15};
BinaryFind bf=new BinaryFind();
bf.find(0, arr.length-1, 15, arr);
}

}
class BinaryFind
{
public void find(int left,int right,int val,int arr[])
{
//首先找到中间的数
int midindex=(left+right)/2;
int midVal=arr[midindex];
//要查找的值比中间值大
if(left<=right)
{
if(val<midVal)
{
//向左边数中找
find(left,midindex-1,val,arr);
}
else if(val>midVal)
{
//向右边数中找
find(midindex+1,right,val,arr);
}
else if(val==midVal)
{
System.out.println("找到下标："+midindex);
}
}
else
{
System.out.println("该数字不存在！");
}
}
}
</span>