Skip to content

Latest commit

 

History

History
6 lines (4 loc) · 195 Bytes

README.md

File metadata and controls

6 lines (4 loc) · 195 Bytes

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.