title: 二分搜索

一個(gè)最簡單的二分搜索示例，原理太簡單就不介紹了，上代碼：

public class BinarySearch {
    public static void main(String[] args){
        //測試數(shù)據(jù)
        int[] a = new int[]{0,1,2,3,4,5,6,7};
        System.out.print(rank(5, a));
    }

    /**
     * @param key 待查找的int
     * @param a int數(shù)組，必須為有序數(shù)據(jù)
     * @return
     */
    public static int rank(int key, int[] a){
        int lo = 0;
        int hi = a.length - 1;

        while (lo <= hi){
            int mid = lo + (hi - lo)/2;
            if(key < a[mid]){
                hi = mid - 1;
            }else if (key > a[mid]){
                lo = mid + 1;
            }else {
                return mid;
            }
        }
        return -1;
    }
}