http://www.perlmonks.org?node_id=817397


in reply to Re^5: Modified Binary Search
in thread Modified Binary Search

How about finding the smallest index that contains a value equal or greater than your target; or highest equal or less?
That doesn't change the complexity.
And how about you post a full sub save all of us trying to recreate your thought?
Too much work to type out all the details.
The proof is in the pudding!
Get any textbook about introductions to algorithms.