数据结构查找实验顺序、折半

1、#include #include #include typedef int Elemtype;void caidan()/菜单函数printf(欢迎来到查找实验！ n);printf(实验内容：n);printf(1)建立一个无序表并实现其上的顺序查找；n);printf(-2)建立一个有序表并实现其上的折半查找(用递归和非递归两种算法实 TOC o 1-5 h z 现)。n); -i -4- -4- t printf(*n), printf(* 1.顺序查找n);printf(* 2.折半查找递归 n); printf(* 3.折半查找非递归n); printf(* 4.退出n);prin

2、tf(*n); printf(请选择：); int SeqSeach(Elemtype a,int n, Elemtype key)/顺序查找 int i; for (i=0;in;i+) if (key=ai)return i+1;return 0;void shuchu(Elemtype a)/输出函数int i;printf(数组里的数据：n);for (i=0;i20;i+)printf(%4d”,ai);printf(n)；/顺序查找void shunzhao()int x,i;Elemtypetest20 = 234,123,345,44,33,22,11,55,66,77,88,

3、99,87,76,65,1,2,3,4,5;shuchu(test);printf(请输入要查找的数据：n);scanf(%d”,&x);i=SeqSeach(test,20,x);if(1=i & ikey)return BinSeach1(a,low,mid-1,key);elsereturn BinSeach1(a,mid+1,high,key);void zhezhaod()/折半查找递归int i,x,low=0,high=19;Elemtypetest20 = 20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39;s

4、huchu(test);printf(请输入要查找的数据：n);scanf(%d”,&x);i=BinSeach1(test,low,high,x);if (i=1 & i=20)printf(查找成功！此数据是数组的第%d个数，下标是：dn”,i,i-1);printf(n)；elseprintf(对不起！查找失败！ n);printf(n)；shuchu(test);int BinSeach2(Elemtype a,int low,int high, Elemtype key) /非递归int mid;while (lowkey)high=mid-1;elselow=mid+1;retur

5、n 0;折半查找非递归void zhezhaofd()int i,x,low=0,high=20;Elemtypetest20 = 20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39;shuchu(test);printf(请输入要查找的数据：n);scanf(%d”,&x);i=BinSeach2(test,low,high,x);if (i=1 & i=20)printf(查找成功！此数据是数组的第%d个数，下标是：dn”,i,i-1);printf(n)；elseprintf(对不起！查找失败！ n);printf(n)；shuchu(test);void main()/主函数int flag=1,c;while (flag)caidan();/调用菜单scanf(%d”,&c);switch (c)case 1:shunzhao(); /调用顺序查找getch();system(CLS);break;case 2:zhezhaod(); /折半查找(递归)getch();system(CLS);break;case 3:zhezhaofd()