Thankssssssssss !!! :-) Nathann
2009/12/10 Carlo Hamalainen <carlo.hamalai...@gmail.com>: > On Thu, Dec 10, 2009 at 10:37 AM, Nathann Cohen <nathann.co...@gmail.com> > wrote: >> After a few tests, lists are slightly better for append/pop than set >> is for add/remove. Obviously remove(i) for lists is linear, and hence >> much longer than it is in sets... > > Time complexity of various operations on sets, lists, dictionaries, > etc, in Python: > > http://wiki.python.org/moin/TimeComplexity > > -- > Carlo Hamalainen > http://carlo-hamalainen.net > > -- > To post to this group, send an email to sage-devel@googlegroups.com > To unsubscribe from this group, send an email to > sage-devel+unsubscr...@googlegroups.com > For more options, visit this group at > http://groups.google.com/group/sage-devel > URL: http://www.sagemath.org > -- To post to this group, send an email to sage-devel@googlegroups.com To unsubscribe from this group, send an email to sage-devel+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/sage-devel URL: http://www.sagemath.org