Cautarea binara

#include <iostream>
using namespace std;
int main()
{
 int m,n,i,j,v[100],x,OK;
 cin>>n>>x;
 for(i=1;i<=n;++i)
  cin>>v[i];
 i=1;
 j=n;
 OK=0;
 while(i<=j && OK==0)
 {
  m=(i+j)/2;
  if(x==v[m])OK=1;
  else if(x>v[m])i=m+1;
  else j=m-1;
 }
 if(OK==1) cout<<„DA”;
 else cout<<„NU”;
 return 0;
}

Advertisements