java基础：二分法查找

package com.atguigu.java2;

import java.util.Arrays;

import org.omg.CORBA.FieldNameHelper;

public class BinarySearch {
	public static void main(String[] args) {
		int[] number = {12,30,-5,6,9,10,5};
	//必须先排序
		Arrays.sort(number);
		System.out.println(Arrays.toString(number));
		
		int findnumber =12; //要找的数值
		int start =0; //起始位置
		int end=number.length-1;   //结束位置
		int index =-1;
		while (start <= end){
			int mid =(start+end)/2;
			if(number[mid]== findnumber){
				index =mid;
				break;
				}else if(number[mid]<findnumber){
					start= mid+1;
				}else{
					end=mid-1;
				}
			}
		
		if (index == -1){
			System.out.println("没有找到你需要的内容");
		}else{
			System.out.println("元素所在的位置是：" + index);
		}
		
		
		
		
		
	}
}

 运行结果：