Steve Howell <showel...@yahoo.com> writes: [...] > My algorithm does exactly N pops and roughly N list accesses, so I > would be going from N*N + N to N + N log N if switched to blist.
Can you post your algorithm? It would be interesting to have a concrete use case to base this discussion on. -- Arnaud -- http://mail.python.org/mailman/listinfo/python-list
