代码:
#include<iostream>
#include<cstdlib>
using namespace std;
#define TABLELEN 10
//---------------辅助函数-----------------------
//查找表结构
typedef struct searchTable {
int* A;
int len;
}STable;
//初始化查找表并给生成随机数组
void Inite_Greate_Array(STable &t) {
t.len = TABLELEN;
t.A = new int[t.len + 1];
for (int i = 1; i <= t.len; ++i) {
t.A[i] = rand() % 100;
}
}
//排序算法
void directedInsertSort(STable &t, int n) {
int i, j;
for (i = 2; i <= n; ++i) {
if (t.A[i] < t.A[i - 1]) {
t.A[0] = t.A[i];
for (j = i - 1; t.A[j] > t.A[0]; --j) {//边比较边移动元素
t.A[j + 1] = t.A[j];
}
t.A[j + 1] = t.A[0];
}
}
}
//打印数列的所有元素
void PrintArray(int A[], int n) {
for (int i = 1; i <= n; ++i) {
cout << A[i] << " ";
}
cout << endl;
}
//---------------------------------
//1、带哨兵的静态顺序查找,查找成功返回下标,查找失败返回0;
int Search(STable &t, int key) {
int i;
t.A[0] = key;
for (i = t.len; t.A[i] != key; --i) {
}
return i;
}
//2、非递归的静态二分查找,查找失败返回0
int BinarySearch(STable &t, int key) {
int low, high, mid;
low = 1;
high = t.len;
while(low<=high) {
mid = (low + high) / 2;
if (t.A[mid] == key) {
return mid;
}
else if (t.A[mid] > key) {
high = mid - 1;
}
else {
low = mid + 1;
}
}
return 0;
}
int main()
{
STable T;
int key,site;
Inite_Greate_Array(T);
cout << "顺序查找:" << endl;
cout << "原始数组:";
PrintArray(T.A, T.len);
cout << "请输入需要查找的数:";
cin >> key;
site = Search(T, key);
if (site != 0) {
cout << key << " 是在数组中的第 " << site << " 个!" << endl;
}
else {
cout << "数组中无元素值 " << key << endl;
}
cout << endl;
cout << "二分法查找:" << endl;
cout << "原始有序数组:";
directedInsertSort(T, T.len);
PrintArray(T.A, T.len);
cout << "请输入需要查找的数:";
cin >> key;
site = BinarySearch(T, key);
if (site != 0) {
cout << key << " 在数组中的第 " << site << " 个!" << endl;
}
else {
cout << "数组中无元素值 " << key << endl;
}
}
运行效果:
顺序查找:
原始数组:41 67 34 0 69 24 78 58 62 64
请输入需要查找的数:62
62 是在数组中的第 9 个!
二分法查找:
原始有序数组:0 24 34 41 58 62 64 67 69 78
请输入需要查找的数:41
41 在数组中的第 4 个!