二分法查找折半查找

1、#include#define elemtype int int sqsearch(elemtype a,int n,elemtype x); 顺序查找int sqsearch2(elemtype a,int n,elemtype x); 顺序查找，打印查找过程int binsearch(elemtype a,int n,elemtype x); 折半查找int binsearch2(elemtype a,int n,elemtype x); 折半查找，打印查找过程void printarray(elemtype a,int n);/ 打印数组数据int main()int i,x;const

2、 int n=9;elemtype a110=0,34,23,12,56,90,78,89,45,67;elemtype a210=0,12,23,34,45,56,67,78,89,90;顺序查找cout顺序查找：endl;couta1=;printarray(a1,n);coutx;if(i=sqsearch(a1,n,x)0)找到cout找到 x=a1iendl;else/未找到cout找不到xendl;coutendl查找过程：endl;sqsearch2(a1,n,x);查找过程cout完成顺序查找！ endl;/二分法查找cout二分法查找：endl;couta2=;printar

3、ray(a2,n);coutx;if(i=binsearch(a2,n,x)0) 找到cout找到 x=a1iendl;else/未找到cout找不到xendl;coutendl查找过程：endl;binsearch2(a2,n,x);cout完成顺序查找！ x)coutaixendl;elsecoutaixendl;return i;/在数组a1.2.n中二分法查找x/找到时返回元素下标，否则返回0/前提：a1.2.n是非递减有序的int binsearch(elemtype a,int n,elemtype x)二分查找int mid,low=1,high=n;while(low=high

4、)mid=(low+high)/2;if(x=amid)return mid;else if(xamid)high=mid-1;elselow=mid+1;return 0;/在数组a1.2.n中二分法查找x，每次打印比较结果/找到时返回元素下标，否则返回0/前提：a1.2.n是非递减有序的int binsearch2(elemtype a,int n,elemtype x)查找过程int mid,low=1,high=n;while(low=high)mid=(low+high)/2;if(x=amid)coutamid=xendl;return mid;else if(xamid)coutamidxendl;high=mid-1;elsecoutamidxendl;low=mid+1;return 0;/打印顺组数据a1.nvoid printarray(int a,i