[sv-ec] linked list amortization

From: Bresticker, Shalom <shalom.bresticker_at_.....>
Date: Tue Sep 25 2007 - 23:27:29 PDT
Hi,

In Annex H (Linked lists), the definition of 'list' in H.2 is:

list: A doubly linked list, where every element has a predecessor and
successor. A list is a sequence that supports
both forward and backward traversal, as well as amortized constant time
insertion and removal of elements
at the beginning, end, or middle.

What does 'amortized' mean here?

Am I the only one who is not going to understand this?

Thanks,
Shalom


Shalom Bresticker
Intel Jerusalem LAD DA
+972 2 589-6852
+972 54 721-1033

---------------------------------------------------------------------
Intel Israel (74) Limited

This e-mail and any attachments may contain confidential material for
the sole use of the intended recipient(s). Any review or distribution
by others is strictly prohibited. If you are not the intended
recipient, please contact the sender and delete all copies.

-- 
This message has been scanned for viruses and
dangerous content by MailScanner, and is
believed to be clean.
Received on Tue Sep 25 23:27:55 2007

This archive was generated by hypermail 2.1.8 : Tue Sep 25 2007 - 23:28:24 PDT