On Tue, Oct 23, 2007 at 08:17:33PM -0400, Danny Yoo wrote:
[helpful explanation snipped]
>
> That being said, if all our operations are applied only at the end of the
> list, the time complexity of those two operations look better. We can
> argue for O(1) behavior under that particular restri
>> Use list when you want a sequence of items indexed by sequential
>> integers. Lists
>> - preserve order
>> - are fast for indexed lookup
>> - are relatively slow (O(n)) for adding, deleting and searching (though
>> for small lists this should not be a consideration)
>
> Are you sure they take O
