二分查找的java实现

package com.yulong;


public class BinarySearch {


/**
* @param args
*/
public static void main(String[] args) {
int key=1;
// TODO Auto-generated method stub
     int[] array={23,34,56,67,78,89,2,3,4,5,7};
     BubbleSort(array);
     print(array);
     int result=binarySearch(array,key);
     if(result==-1){
    System.out.println("no find");
     }else{
    System.out.println("array["+result+"]"+"="+array[result]);
     }
}


private static void print(int[] array) {
// TODO Auto-generated method stub
for(int i=0;i<array.length;i++){
System.out.print(array[i]+" ");
}
System.out.println();
}


private static int binarySearch(int[] array, int key) {
// TODO Auto-generated method stub
int low=0;
int hight=array.length-1;
while(low<=hight){
int middle=(hight+low)/2;
if(array[middle]==key)
return middle;
else if(key<array[middle]){
hight=middle-1;
}else{
low=middle+1;
}
}
return -1;
}


private static void BubbleSort(int[] array) {
// TODO Auto-generated method stub
for(int i=0;i<array.length-1;i++){
for(int j=i+1;j<array.length;j++){
if(array[i]>array[j]){
int temp=array[i];
array[i]=array[j];
array[j]=temp;
}
}
}
}
    
}