代码大全_二分查找

二分查找

public static boolean BinSearch(int[] nums,int aNum){
        int left = 0;
        int midium;
        int right = nums.length-1;
        while( left <= right ){
            midium = (left + right)/2;
            if (nums[midium] == aNum ){
                return midium;
            }else if(nums[midium] < aNum){
                left = midium + 1;
            }else {
                right = midium - 1;
            }
        }
        return -1;
    }