Cod sursa(job #2198645)
Utilizator | Data | 24 aprilie 2018 22:08:10 | |
---|---|---|---|
Problema | Cautare binara | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
using namespace std;
int v[100], n, nr;
ifstream fin("cautbin.in");
ofstream fout("cautbin.out")
void caut(int i, int j)
{
int m = (i+j)/2;
if (nr==v[m])
fout<<"gasit, indice="<<m;
else
if (i<j)
if (nr<v[m])
caut(i, m-1);
else caut(m+1, j);
else fout<<"nu a fost gasit.";
}
int main( )
{
fout<<"n="; fin>>n;
for (int i=1; i<=n; i++)
{
fout<<"v["<<i<<"]="; fin>>v[i];
}
fout<<"nr="; fin>>nr;
caut (0,n);
return 0;
}