Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <algorithm>
- int main()
- {
- int niz[10] {1, 3, 5, 7, 9, 10, 8, 6, 4, 2}, n;
- std::sort(niz, niz+10);
- std::cout << "Unesite n: ";
- std::cin >> n;
- if(std::binary_search(niz, niz+10, n))
- std::cout << "Element " << n << " se nalazi na " << std::lower_bound(niz, niz+10, n) - niz + 1 << " poziciji!";
- else
- std::cout << "Element " << n << " nije nadjen!";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement