Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cmath>
- #include <algorithm>
- using namespace std;
- int main () {
- int niz[10]={2,3,66,55,4,2,7,8,12,78};
- sort(niz,niz+10);
- if (binary_search(niz,niz+10,55)) {
- cout<<"Element 55 se nalazi na poziciji: "<<lower_bound(niz,niz+10,55)-niz;
- }
- else cout<<"Element 55 se ne nalazi u nizu.";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement