用java实现折半查找的代码如下:
package com;
import java.util.Scanner;
public class binarySearch{
public static void main(String[] args) {
int arr[]={11,23,26,30,36};
System.out.println("请输入要查找的元素:");
Scanner scan = new Scanner(System.in);
int target=scan.nextInt();
int low=0;
int high=arr.length-1;
while(low<=high){
int mid=(low+high)/2;
if(arr[mid]==target){
System.out.println("查找成功!"+target+"位于数组arr的下标为:"+mid);
return;
}
else if(arr[mid]>target)
high=mid-1;
else
low=mid+1;
}
System.out.println("没有在arr数组中找到元素"+target);
}
}