Regarding the statement: I don't believe it is possible to code a search over sorted data with duplicates that comes even close to be O(log N). Even in theory. And in practical implementations, it'd be far slower.
Why would the following logic be so much slower in implementation?
Cheers - L~R
In reply to Re^4: Modified Binary Search
by Limbic~Region
in thread Modified Binary Search
by Limbic~Region
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |