cosmin Administrator

Data inscrierii: 30/Apr/2010 Mesaje: 12
|
Trimis: 30/04/2010 09:24 Titlul subiectului: BinarySearch |
|
|
#include<iostream>
using namespace std;
int v[100],n,nr;
int caut(int i, int j)
{
int m=(i+j)/2;
if(nr==v[m])
cout<<"pozitie="<<m;
else
if(i<j)
if(nr<v[m])
caut(i,m-1);
else caut(m+1,j);
else cout<<"nu a fost gasit";
}
int main()
{
int i;
cout<<"n=";cin>>n;
for(i=1;i<=n;i++)
{
cout<<"v["<<i<<"]=";cin>>v[i];
}
cout<<"nr=";cin>>nr;
caut (1,n);
} |
|