Cliff, or a close facsimile wrote: > I don't know how lists are implemented in Python, but if they're > linked lists instead of arrays, then deleting an element (once > you've already found it) should take constant time. But then the > append will be O(n). They're not linked lists. They are arrays of pointers. - Gordon