二分查找

int binary_search(int num, int* p, int len){int high,low,mid;low = 0;high = len - 1;while(low <= high){mid = low + (high-low)/2;if(num < p[mid]){high = mid -1;}else if(num > p[mid]){low = mid +1;}else{return mid;}}return -1;}