Pagini recente » Cod sursa (job #2720563) | Cod sursa (job #551291) | Statistici Dan Octavian (oykoj98) | Cod sursa (job #1248235) | Cod sursa (job #2696546)
// 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;
}