二分法查找元素

很简单就不注释了

public class BinarySearch 
{
    public static void  main(String[] args) {
    	int[] list = {1,3,5,7,9,12,14,16,18};
    	int k=binnarySearch(list,5);
    	if(k==-1)
    		System.out.println("without this number");
    	else
    		System.out.printf("it's postion is %d" ,k+1);
    	
    }
    
    
	public static int binnarySearch(int[] list,int key) {
		int low=0;
		int high= list.length-1;
		while(high>=low) {
			int mid = (low+high)/2;
			if(key<list[mid])
				high=mid-1;
			else if(key == list[mid])
			{
				//System.out.println(mid);
				return mid;
			}
			else
				low=mid+1;
			
		}
		return -1;
	}
}

学一门新语言的时候，搞清楚怎么调用其实并不是一件很简单的事情~~~
so，真的不喜欢那种只写方法的代码块。能把完整代码贴出来吗各位