實驗5查找算法實驗報告劉佑佩

實驗5查找算法實驗?zāi)康?)掌握有序表、無序表查找的基本思想及存儲、運算的實現(xiàn)2)深刻理解多個算法的特點，并加以靈活應(yīng)用3）加深對查找的理解，逐步培養(yǎng)解決實際問題的編程能力實驗環(huán)境1)硬件：每個學生需配備計算機一臺，操作系統(tǒng)：Windows/XP。；2)軟件：visualc++6.0。實驗學時3學時實驗內(nèi)容1)建立一種無序表并實現(xiàn)其上的次序查找；2)建立一種有序表并實現(xiàn)其上的折半查找（用遞歸和非遞歸兩種算法實現(xiàn)）；實驗代碼簡樸排序查找：/*Note:YourchoiceisCIDE*/#include"stdio.h"voidmain(){inti,a[10],n=1,b,h;printf("請輸入10個數(shù)字,*號結(jié)束：\n");for(i=0;i<=9;i++){printf("請輸入序號是%d的數(shù)字：",i);scanf("%d",&a[i]);}printf("請輸入要查找的數(shù)字值：");scanf("%d",&b);for(i=0;i<10;i++){if(a[i]==b){h=i;break;}if(i==9)h=-1;}if(h==-1){printf("\n此數(shù)字不在該數(shù)組中");}elseprintf("該數(shù)字的位置在數(shù)組序號%d",h);}非遞歸查找：#include<stdio.h>inteff(intc,intyxb[]){intmid,a=0,b=9;while((b-a)>1){mid=(a+b)/2;if(yxb[mid]==c){returnmid;break;}elseif(c>yxb[mid]){a=mid+1;}else{b=mid-1;}}if((b-a)==1){if(yxb[a]==c){returna;}elseif(yxb[b]==c){returnb;}elsereturn-1;}}voidmain(){intyxb[10]={1,2,6,12,21,22,32,36,40,46};intc,i,mm;for(i=0;i<=9;i++){printf("序號%d的值:%d\n",i,yxb[i]);}printf("\npleaseinputyxb!:"); scanf("%d",&c);mm=eff(c,yxb); printf("thezhi%dlocatin:%d\n\n",c,mm);}運行成果：遞歸函數(shù)：#include<stdio.h>inta=0,b=9,A,B;intmid,i;inteff(intc,intyxb[]){mid=(a+b)/2;if(yxb[mid]==c){returnmid;}elseif(c>yxb[mid]){a=mid+1;}elseb=mid-1;A=b-a;if(A>1){eff(c,yxb);}else{if(yxb[a]==c){returna;}elseif(yxb[b]==c){returnb;}elsereturn-1;}}voidmain(){intyxb[10]={1,2,6,12,21,22,32,36,40,46};intc,i,mm;for(i=0;i<=9;i++){printf("序號%d的值:%d\n",i,yxb[i]);}printf("\npleaseinputyxb!:"); scanf("%d",&c);mm=eff(c,yxb); print