You can easily find the smallest index containing your target value
How about finding the smallest index that contains a value equal or greater than your target; or highest equal or less?
And how about you post a full sub save all of us trying to recreate your thought?
It doesn't increase the run time complexity
The proof is in the pudding!
In reply to Re^5: Modified Binary Search
by BrowserUk
in thread Modified Binary Search
by Limbic~Region
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |