Cod sursa(job #1028551)
| Utilizator | Data | 14 noiembrie 2013 13:26:37 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<iostream.h>
#include<fstream.h>
int binar(long a[100],long x, long y, long k)
{
long m;
m=(x+y)/2;
if(k==a[m])
return 1;
else if(x==y)
return 0;
else if(k>a[m])
return binar(a,m+1,y,k);
else return binar(a,x,m,k);
}
int main()
{
ifstream w("l1.txt");
long a[100],n,k,p;int i;
cin>>k;
w>>n;
for(i=0;i<n;i++)
w>>a[i];
p=binar(a,0,n-1,k);
if(p==1)
cout<<"Elementul cautat se afla in sir"<<endl;
else cout<<"Elementul cautat NU se afla in sir"<<endl;
system("PAUSE");
}