cpp1.cpp

分治算法在数组中找是否存在两个数相加值为X的

#include"iostream.h"
int find(int a[],int k,int n,int x)
{
	if(k<n)
	{
		if(a[k]+a[n]>x)
			return find(a,k,n-1,x);
		else if(a[k]+a[n]<x)
			return find(a,k+1,n,x);
		else
			return 1;
	}
	else
		return 0;
}

void main()
{
	int x,n,found;
	cin>>n;
	cin>>x;
	int *a=new int[n];
	for(int i=1;i<=n;i++)
		cin>>a[i];
	found=find(a,1,n,x);
	if(found==1)
		cout<<"find"<<endl;
	else
		cout<<"nofind"<<endl;
}