二分法查找

package com.mycom.sendtoapp;

public class test {
public static int binarySearch(int[] array, int param){
int start = 0;
int end = array.length-1;
for (int i = 0; i < array.length; i++) {
int middle = (start+end)/2;
if(array[middle]==param){
return i;
}
else if(array[middle]>param){
end = middle-1;
}
else{
start = middle+1;
}
}
return -1;
}
public static void main(String[] args) {
int [] array= {1,2,3,4,5,6,7};
int position = binarySearch(array, 2);
System.out.println(position);
}
}