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.
-
Notifications
You must be signed in to change notification settings - Fork 0
naughtyfox/upper_bound
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published