实验预备知识:
1. 熟练运用指针进行程序设计,掌握结构体指针。
2. 掌握使用结构体指针访问结构体变量。
3. 掌握指针作为函数的参数使用。
4. 理解查找的含义、目的和处理方法。
一、实验目的
- 理解和掌握查找的几种类型方法。
- 定义基本运算,构建相应算法库。
- 学习利用查找解决实际问题
二、实验要求
【项目1 –静态查找算法验证】
此处给出了顺序查找、折半查找、分块查找的算法,运行并重复测试教学内容中涉及的算法。使用你的测试数据,并展示测试结果,观察运行结果,以此来领会算法。参考代码见附录。
(1) 顺序查找 7-1.cpp
(2) 折半查找 7-2.cpp
(3) 分块查找 7-3.cpp
请自行建立静态查找的算法库。
【项目2 - 利用以上查找方法解决问题】
- 认真阅读并验证折半查找算法。请用有序表{12,18,24,35,47,50,62,83,90,115,134}作为测试序列,分别对查找90、47、100进行测试。请利用前面的算法进行算法的改写,将以下内容通过程序进行结果的输出。
(1)用二分查找法查找90时,需进行多少次查找可确定成功?
(2)当查找47时需进行多少次查找可确定成功?
(3)查找100时,需进行多少次查找才能确定不成功?
程序代码:
main.cpp:
#include <iostream>
#include "head.h"
using namespace std;
int main()
{
SqList s;
KeyType a[] = {12,18,24,35,47,50,62,83,90,115,134};
int n = 11;
int result;
for(int i=0;i<n;i++)
s[i].key = a[i];
result = BinSearch(s,n,47);
if(result == 0)
printf("查找失败\n");
else
printf("查找成功,下标为%d\n",result);
return 0;
}
source.cpp:
#include "head.h"
int BinSearch(SqList s,int n,KeyType k)
{
int low = 0;
int high = n-1;
int mid;
int time = 0;
while(low <= high)
{
mid = (low + high)/2;
if(s[mid].key == k)
{
time++;
printf("共查找%d次\n",time);
return mid+1;
}
else if(s[mid].key > k)
{
high = mid-1;
time++;
}
else
{
low = mid + 1;
time++;
}
}
return 0;
}
head.h:
#ifndef HEAD_H_INCLUDED
#define HEAD_H_INCLUDED
#include <stdio.h>
#include <malloc.h>
#define MaxSize 100
typedef int KeyType;
typedef char InfoType[10];
typedef struct
{
KeyType key;
InfoType info;
}NodeType;
typedef NodeType SqList[MaxSize];//顺序表类型
int SqSearch(SqList s,int n,KeyType k);
int BinSearch(SqList s,int n,KeyType k);
#endif // HEAD_H_INCLUDED
运行结果截图:
- 认真阅读并验证分块查找算法。请用
22,4,23,11,20,2,15,13,30,45,26,34,29,35,26,36,55,98,56,74,61,90,80,96,127,158,116,114,128,113,115,102,184,211,243,188,187,218,195,210,279,307,492,452,408,361,421,399,856,523,704,703,697,535,534,739(共n=56个数据,每块数据个数s=8)作为数据表,自行构造索引表,分别对查找61、739、200进行测试
程序代码:
main.cpp:
#include <iostream>
#include "head.h"
using namespace std;
int main()
{
int i,n=56,m=8,j;
SqList R;
IDX I = {{22,0},{45,8},{98,16},{158,24},{243,32},{492,40},{856,48}};
KeyType a[] = {22,4,23,11,20,2,15,13,30,45,26,34,29,35,26,36,55,98,
56,74,61,90,80,96,127,158,116,114,128,113,115,102,184,
211,243,188,187,218,195,210,279,307,492,452,408,361,421,
399,856,523,704,703,697,535,534,739};
KeyType x=61;
for(i=0;i<n;i++)
R[i].key = a[i];
j=IdxSearch(I,m,R,n,x);
if(i != 0)
printf("%d是第%d个数据\n",x,j);
else
printf("未找到%d\n",x);
return 0;
}
source.cpp:
#include "head.h"
int SqSearch(SqList s,int n,KeyType k)
{
int i = 0;
while(i<n && s[i].key != k)
i++;
if(i>=n)
return 0;
else
return i+1;
}
int BinSearch(SqList s,int n,KeyType k)
{
int low = 0;
int high = n-1;
int mid;
int time = 0;
while(low <= high)
{
mid = (low + high)/2;
if(s[mid].key == k)
{
time++;
printf("共查找%d次\n",time);
return mid+1;
}
else if(s[mid].key > k)
{
high = mid-1;
time++;
}
else
{
low = mid + 1;
time++;
}
}
printf("共查找%d次\n",time);
return 0;
}
int IdxSearch(IDX idx,int m,SqList s,int n,KeyType k)
{
int i = 0;
int start;
int b = n/m;
while(i<m && idx[i].key<k)//确定在哪一块
i++;
if(i>=m) return 0;
start = idx[i].link;
i = start;
//在块中查找
while(i<start + b && s[i].key != k)
i++;
if(i>=start+b)
return 0;
else
return i+1;
}
head.h:
#ifndef HEAD_H_INCLUDED
#define HEAD_H_INCLUDED
#include <stdio.h>
#include <malloc.h>
#define MaxSize 100
typedef int KeyType;
typedef char InfoType[10];
typedef struct
{
KeyType key;
InfoType info;
}NodeType;
typedef NodeType SqList[MaxSize];//顺序表类型
//索引
typedef struct
{
KeyType key;
int link;
}IdxType;
typedef IdxType IDX[MaxSize];
int SqSearch(SqList s,int n,KeyType k);
int BinSearch(SqList s,int n,KeyType k);
int IdxSearch(IDX idx,int m,SqList s,int n,KeyType k);
#endif // HEAD_H_INCLUDED
运行结果截图: