Most efficient solution?

Alexandre Fayolle alf at leo.logilab.fr
Mon Jul 16 19:11:34 CEST 2001


On 16 Jul 2001 11:57:13 -0400, Alex <new_name at mit.edu> wrote:
>
>Oh, I'd thought hash lookups were constant time.  That's interesting.

Well, there goes my credibility. Of course hash lookups are more or less 
constant time. I've been working with the mapping types in C++ STL which
are binary trees, and therefore have log(n) access time. 

Please accept my apologies for replying before having completed the context
switch.

Alexandre Fayolle
-- 
LOGILAB, Paris (France).
http://www.logilab.com   http://www.logilab.fr  http://www.logilab.org
Narval, the first software agent available as free software (GPL).



More information about the Python-list mailing list