Hello everybody

I remember from the trenches that LW implementation of INTERSECTION and UNION does not have (expected) linear time complexity.

Before I go ahead checking the various implementations, does anybody know what is the time complexity of, at least, FIND, FIND-IF, POSITION and POSITION-IF for VECTOR inputs in various implementations?  That is, does anybody know whether these functions have at least O(lg n) time complexity in any of the implementations out there?

All the best

Marco

--