Peti tut, 5.zad

#include <iostream>
#include <algorithm>

bool f(int x, int n)
{
    if (x<n) return true;
    return false;
}



int main()
{
    int niz[50] {1,2,5,8,7,9,6,4,5,12,23,11,56,16,18,20,17,18,2,21,22,24,26,28,27,22,34,26,
                 99,88,77,44,55,66,33,22,11,44,2,1,55,4,111,22,12,87,82,45,63,52
                };
    int n;

    std::sort(niz, niz+50);
    for(int x : niz)

        std::cout << x << " " ;
    std:: cout << std::endl;

    std::cout<<"Unesi n:\n ";
    std::cin>>n;

    if(std::binary_search(niz, niz+50 , n)){
        std::cout << "ima u nizu ";
        int *pok = std::lower_bound(niz, niz+50 , n);

        std::cout << " i nalazi se na: "<< pok - niz;
    }
    else std::cout << "nije u nizu ";


    return 0;
}