upper_bound

Implements simple function bsearch that searches the first element greater than x in given int sorted array. Complexity is O(log(n)).

main function contains use examples.