java数组中二分查找Demo范例

package day02;
import java.util.Arrays;

import day01.ArraySortDemo;

//实现二分查找，首先要先保证数组是有序的

class HalfSearchDemo {
public static void main(String[] args) {
int[] arr={2,1,6,8,7,4,3,4,6,9,12,32,25,24,26};
Arrays.sort(arr);
ArraySortDemo.printArray(arr);
int index=halfSearch_2(arr,280);
System.out.println("index:"+index);

}

public static int halfSearch_2(int[] arr,int key){

//定义最大最小及中间值角标
int min=0,max=arr.length-1,mid=0;

//只要min的值小于max的值就可以折半
while(min<=max){
mid=(min+max)/2;

if(arr[mid]>key){
max=mid-1;
}
else if(arr[mid]<key){
min=mid+1;
}
else{
return mid;
}
}
if(key>arr[arr.length-1]){
return mid+1;
}

//如果没有找到怎返回最小角标的负数-1
return -min-1;
}