Cod sursa(job #2696555)
| Utilizator | Data | 16 ianuarie 2021 10:01:34 | |
|---|---|---|---|
| Problema | Ridicare la putere in timp logaritmic | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
// CAUTARE BINARA //
#include <iostream>
#include <algorithm>
using namespace std;
int x,n,a[100001],mj,dr,st;
int coutbin(int x)
{
int st=0,dr=n,poz=0;
while(st<=dr && poz==0)
{
mj=(st+dr)/2;
if(a[mj]==x)poz=mj;
if(x<a[mj])dr=mj-1;
else st=mj+1;
}
return poz;
}
int main()
{
cin>>n>>x;
for(int i=1;i<=n;i++)
{
cin>>a[i];
}
cout<<coutbin(x);
return 0;
}
