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 < bmsch...@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@lists.sugarlabs.org > http://lists.sugarlabs.org/listinfo/sugar-devel > >
_______________________________________________ Sugar-devel mailing list Sugar-devel@lists.sugarlabs.org http://lists.sugarlabs.org/listinfo/sugar-devel
