[Sugar-devel] I'm looking for a tree...

[Carol Farlow Lerche]

hash chaining only approaches order n if the table is very full (because of
collisions).

On Sun, Jun 7, 2009 at 8:07 AM, Benjamin M. Schwartz <
bmschwar at fas.harvard.edu> wrote:

> Lucian Branescu wrote:
> > This http://www.python.org/dev/peps/pep-0372/ might be interesting.
> > Perhaps it could get backported to 2.5.
> >
> > But it still has O(n) deletion.
>
> It also doesn't have insertion at all (only append), and indexing (and
> reverse indexing) is O(n).
>
> --Ben
>
>
> _______________________________________________
> Sugar-devel mailing list
> Sugar-devel at lists.sugarlabs.org
> http://lists.sugarlabs.org/listinfo/sugar-devel
>
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://lists.sugarlabs.org/archive/sugar-devel/attachments/20090607/85a41ba5/attachment.htm