菜鸟Java大面经----------------关于二分法

阅读更多

关于二分法

package com.ahuiby.demo1;

public class BinarySearch {
	
	//二分法
	public static int binarySearch(int arr[],int key){
		int begin=0;
		int end =arr.length-1;
		
		while(begin<=end){
			if(arr[(begin+end)/2]