代码如下:
#include<iostream>
using namespace std;
const int MaxSize = 100;
class LineSearch
{
public:
LineSearch(int a[], int n); //构造函数
~LineSearch() { } //析构函数为空
int SeqSearch(int k); //顺序查找
int BinSearch1(int k); //折半非递归查找
int BinSearch2(int low, int high, int k); //折半递归查找
private:
int data[MaxSize]; //查找集合为整型
int length; //查找集合的元素个数
};
LineSearch::LineSearch(int a[], int n)
{
for (int i = 0; i < n; i++)
data[i + 1] = a[i]; //查找集合从下标1开始存放
length = n;
}
int LineSearch::SeqSearch(int k)
{
int i = length; //从数组高端开始比较
data[0] = k; //设置哨兵
while (data[i] != k) //不用判断下标i是否越界
i--;
return i;
}
int LineSearch::BinSearch1(int k)
{
int mid, low = 1, high = length; //初始查找区间是[1, n]
while (low <= high) //当区间存在时
{
mid = (low + high) / 2;
if (k < data[mid]) high = mid - 1;
else if (k > data[mid]) low = mid + 1;
else return mid; //查找成功,返回元素序号
}
return 0; //查找失败,返回0
}
int LineSearch::BinSearch2(int low, int high, int k)
{
if (low > high) return 0; //递归的边界条件
else {
int mid = (low + high) / 2;
if (k < data[mid]) return BinSearch2(low, mid - 1, k);
else if (k > data[mid]) return BinSearch2(mid + 1, high, k);
else return mid; //查找成功,返回序号
}
}
int main()
{
int arr1[10] = { 9,8,7,3,4,6,5,2,1,10 };
int arr2[10] = { 1,2,3,4,5,6,7,8,9,10 };
LineSearch L1{ arr1, 10 }, L2{ arr2, 10 };
int select, key, index = 0;
cout << "***---- 选择想使用的查找算法 ---*** "
<< " 1.顺序查找 " << endl
<< " 2.折半查找(非递归) " << endl
<< " 3.折半查找(递归) "
<< "***--- 请输入序号:";
cin >> select;
cout << " ***--- 请输入想查找的值:";
cin >> key;
switch (select)
{
case 1:index = L1.SeqSearch(key); break;
case 2:index = L2.BinSearch1(key); break;
case 3:index = L2.BinSearch2(1, 10, key); break;
default: cout << "输入有误" << endl; system("pause"); break;
}
cout << " 位置为:" << index << endl;
return 0;
}