Cod sursa(job #1623316)
| Utilizator | Data | 1 martie 2016 18:45:12 | |
|---|---|---|---|
| Problema | Cautare binara | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
int a[1001],n;
ifstream fin("CautBin.in");
ofstream fout("CautBin.out");
void Citire()
{
int i;
fin>>n;
for(i=1;i<=n;i++)
fin>>a[i];
fin.close();
}
int CautareBinara2(int x)/// cea mai din dr
{
int st=1,dr=n,m,poz;
while(st<=dr)
{
m=(st+dr)/2;
if(a[m]<=x)
{
st=m+1;
poz=m;
}
else dr=m-1;
}
return poz;
}
int main()
{
Citire();
fout<<CautareBinara2(5)<<"\n";
return 0;
}
