Howe Tan 浪漫的季节的博客

用递归方法实现二分查找，为了避免异常情况，首先判断上下限范围int binarysearch(int source[],int low,int,high,int targetvalue){ if (low>high) return; int temp= (high-low)/2+low; if(source[temp]>targetvalue) binarysearch(source,low,temp-1,targetvalue); if(source[