二分查找代码

int bsearchWithoutRecursion(int array[],int low,int high,int target)
{
    while(low<=high)
        {
            int mid=(low+high)/2;
            if(array[mid]>target)
                high=mid-1;
            else if(array[mid]<target)
            low=mid+1;
            else
                return mid;
        }
    return-1;
}

 扩展：

http://www.cnblogs.com/luoxn28/p/5767571.html

http://blog.csdn.net/yefengzhichen/article/details/52372407

http://www.ahathinking.com/archives/179.html

http://blog.csdn.net/clockwiser/article/details/8019069

http://www.cnblogs.com/huashanqingzhu/p/6882821.html