Internals and complexity of types, containers and algorithms

["Martin v. Löwis"]

Paul Rubin schrieb:
> "Martin v. Löwis" <martin at v.loewis.de> writes:
>> Amortized O(1) for inserting into lists.
> 
> I think you mean amortized O(1) for appending to lists.

Indeed so; insertion is O(n).

Regards,
Martin