package com.bjpowernode.javase.array;
import java.util.Arrays;
public class UtilArray {
public static void main(String[] args) {
int[] array = {100,200,230,235,600,1000,2000,9999};
int result= UtilArray.select(array,200);
System.out.println(result==-1? "该元素不存在":"该元素下标为"+result);
}
private static int select(int[] array, int i) {
//起始坐标
int begin = 0;
//结束坐标
int end = array.length-1;
while(end>=begin){
//中间元素坐标
int mid = (end+begin)/2;
if (array[mid]==i){
return mid;
}else if(array[mid]>i){
end = mid-1;
}else if(array[mid]<i){
begin=mid+1;
}
}
return -1;
}
}
用java手写实现二分法查找数组
最新推荐文章于 2022-11-27 22:39:54 发布