int binary_find(int *array, int array_size, int target) {
int low = 0;
int high = array_size - 1;
int mid = 0;
int midValue = 0;
while (low <= high) {
mid = (low + high) / 2;
midValue = array[mid];
if (midValue < target) {
low = mid + 1;
} else if (midValue > target) {
high = mid - 1;
} else {
return mid;
}
}
return -1;
}
C语言二分查找法
最新推荐文章于 2022-12-18 20:14:52 发布