fast pythonic algorithm question

[David Reed]

On Aug 1, 2006, at 11:13 AM, Diez B. Roggisch wrote:

> Guyon Morée wrote:
>
>> Memory is no problem. It just needs to be as fast as possible, if
>> that's what this is, fine.
>>
>> If not, I'd like to find out what is :)
>
> 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.


> most cases, where bisection or other order-based lookups have O(log n)
>
> Additionally, dict lookups are fully written in C.
>
> Diez

Dave