二分法查找___查找前必先排好序

public class BinarySearch {  
 
    public BinarySearch() {  
    }  
 
    public static int binarySearch(int[] datas, int key) {  
        int index = -1;  
        int low = 0;  
        int high = datas.length - 1;  
        while (low <= high) {  
            int middle = (low + high) >> 1; //向右移一位，即除以2 
            if (key == datas[middle]) {  
                index = middle;  
                break;  
            } else if (key > datas[middle]) {  
                low = middle + 1;  
            } else if (key < datas[middle]) {  
                high = middle - 1;  
            }  
        }  
        return index;  
    }  
 
    public static void main(String[] args) {  
        int[] datas = { 1, 2, 3, 4, 5, 6 };  
        int index = BinarySearch.binarySearch(datas, 6);  
        System.out.println(index);  
    }  
}