Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int n, a[100];
- int binar(int st, int dr, int x)
- {
- int m;
- if(st==dr)
- if(x==a[st])
- return st;
- else
- return 0;
- else
- {
- m=(st+dr)/2;
- if(x==a[m])
- return m;
- else
- if(x>a[m])
- return binar(m+1, dr, x);
- else
- return binar(st, m-1, x);
- }
- }
- int main()
- {
- int st, dr, x, n, a[100],b;
- cout<<"x= "; cin>>x;
- cout<<"n= "; cin>>n;
- for(int i=1; i<=n; i++)
- cin>>a[i];
- //int(st, dr, x);
- b=binar(1, n, x);
- if(b)
- cout<<"da, pe pozitia "<<b;
- else
- cout<<"nu";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement