第十四周项目1验证折半查找_折半查找的实现和运算typedef struct{ keytype key; char name[2-优快云博客

本文介绍了二分查找算法的两种实现方法：非递归式和递归式。非递归式的实现通过迭代的方式进行查找，而递归式的方法则利用递归特性不断缩小查找范围。两种方法均适用于有序数组中快速定位特定元素。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

非递归式：

#include<iostream>
using namespace std;
int main()
{
	int low=0,high,n;
	int a[100];
	int i=0,f;
		cout<<"Please input the number of data and what data do you want to find"<<endl;
	while(cin>>n)
	{

	cin>>f;
	high=n-1;
	while(i<n)
	{
		cin>>a[i];
		i++;
	}
	int mid;
	while(low<=high)
	{
		mid=(low+high)/2;
		if(a[mid]==f)
		{
			cout<<"find in the postion "<<mid+1<<endl;
			break;
		}
		if(a[mid]>f)
		{
			high=mid-1;
		}
		else
		{
			low=mid+1;
		}


	}
	if(low>high)
	{
		cout<<"can't find it"<<endl;
	}
		cout<<"Please input the number of data and what data do you want to find"<<endl;
		low=0;
		i=0;
	}
	return 0;


}

递归方式：

#include<iostream>
using namespace std;
void digui(int low,int high,int a[],int f);
int main()
{
	int low=0,high,i=0;
	int f,a[50],n;
	cin>>n>>f;
	while(i<n)
	{
		cin>>a[i];
		i++;
	}
	high=n-1;
	digui(low,high,a,f);
	return 0;
}
void digui(int low,int high,int a[],int f)
{
	int mid;
	mid=(high-low)/2;
	if(low<=high)
	{
		if(a[mid]==f)
		{
			cout<<"find in "<<mid+1;
		
		}
		else if(a[mid]<f)
		{
			digui(mid+1,high,a,f);
		}
		else
		{
			digui(low,mid-1,a,f);
		}
	}
	if(low>high)
		cout<<"not find"<<endl;
}