Cod sursa(job #1890263)
| Utilizator | Data | 23 februarie 2017 10:33:23 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <conio.h>
#include <fstream>
using namespace std;
int cb(int a[100],int p, int q, int x)
{
int m;
if(p>q)
return -1;
m=(p+q)/2;
if(a[m]==x)
return m;
else if(a[m]<x)
return cb(a,m+1,q,x);
else
return cb(a,p,m-1,x);
}
int main()
{
int fis,n, i, a[30], j, k,l,x;
fstream f1("cautbin.in", ios::in);
fstream f2("cautbin.out", ios::out);
f1>>fis;
for(l=1; l<=fis; l++)
{
f1>>n;
for(i=0; i<n; i++)
{
f1>>a[i];
}
f1>>x;
}
f2<<cb(a,0,n-1,x);
return 0;
}
