fast pythonic algorithm question

[Diez B. Roggisch]

>> I'd say it is as fast as it can get - using hashing for lookups is O
>> (n) in
> 
> 
> I know you meant O(1) for hash lookups, but just in case anyone is
> confused, I figured I'd correct this.

Ooops. Thanks.

Diez