On 10/7/10 14:40 CDT, bearophile wrote:
Another solution is just to accept O(n) as the worst complexity for the "in" operator. I don't understand what's the problem in this.
That means we'd have to define another operation, i.e. "quickIn" that has O(log n) bound.
Andrei
