折半查找: low=0;high=N-1; while(low<=high) { mid=(low+high)/2; if(key==r[mid]){ find=1;break; } else if(key<r[mid]){ high=mid-1; } else if(key>r[mid]){ low=mid+1; } } 冒泡