此博客展示了用C++实现二分查找算法的代码。定义了BinSearch函数，通过设置low和high指针，在循环中不断取中间值与目标值比较，缩小查找范围，若找到目标值则返回其索引，未找到则返回 -1。
int SeqSearch(int arr[], int len, int target)
{
??? int i = 0;
??? while ((i != len) && (arr[i] != target))
??? {
??????? i++;
??? }
??? if (i < len)
??? {
??????? return i;
??? }
??? else
??? {
??????? return -1;
??? }
}
{
??? int i = 0;
??? while ((i != len) && (arr[i] != target))
??? {
??????? i++;
??? }
??? if (i < len)
??? {
??????? return i;
??? }
??? else
??? {
??????? return -1;
??? }
}
int BinSearch(int arr[], int len, int target)
{
??? int low = 0;
??? int high = len-1;
??? while (low <= high)
??? {
??????? int mid = (low + high) / 2;
??????? if (arr[mid] == target)
??????? {
??????????? return mid;
??????? }
??????? else if (arr[mid] > target)
??????? {
??????????? high = mid - 1;
??????? }
??????? else
??????? {
??????????? low = mid + 1;
??????? }
??? }
??? return -1;
}
扫一扫
1432
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
