**
小白自学1 折半查找
**
-----|-------------------------------|-----------------------------|
用的是VS2019,完全小白,自学了一点点
#include <stdio.h>
#include <stdlib.h>
#include <iostream>
using namespace std;
int BinSearch(int r[], int n, int k;
{
int low = 0, high = n - 1;
int mid;
while (low < high)
{
mid = (low <= high) / 2;
if (k < r[mid]) high = mid - 1;
else if (k > r[mid]) low = mid + 1;
else return mid;
}
return 0;
}
int main()
{
int r[] = { 7,14,18,21,23,29,31,35,38 };
int i;
cout << "请输入查找的数字(输出下标,无则返回-1) :" ;
cin >> i;
cout << endl;
i = BinSearch(r, 10, i);
cout << i << endl;
}
运行结果有问题,求批评指正