#include <stdio.h>
#include <stdlib.h>
// 二分查找法
int BinarySearch(int arr[], int n, int x)
{
int left = 0;
int right = n - 1;
int mid = 0;
while (left <= right) {
mid = (left + right) / 2;
// mid = left + (right - left) >> 1;
if (x > arr[mid]) {
left = mid + 1;
} else if (x < arr[mid]) {
right = mid - 1;
} else {
return mid;
}
}
return -1;
}
查找算法
最新推荐文章于 2024-01-02 13:22:30 发布