i
£i
L
I
S
T
T, E, S, T, T, E, S, T
E
L
I
S
T
T, E, S, T, T, E, S, T
4 + 5 + 3 + 4 + 4 + 5 + 3 + 4 = 32
E
L
I
S
T
T
L I S T E
E
T L I S E
S
E T
L I S
T
S E
T L I
E
L
I
S
T
T, E, S, T, T, E, S, T 4 + 5 + 5 + 3 + 1 + 3 + 3 + 3 = 27
E
L
I
S
T
T
L I
S T E
E
L I
T S E
S
L I T E S
T
L I T S E
E
L
I
S
T
T, E, S, T, T, E, S, T 4 + 5 + 5 + 3 + 2 + 5 + 5 + 1 = 30
E
L
I
S
T
T
L I
S T E
E
T L
I S E
S
E T L I S
T
S E T L I
E
L
I
S
T
T, E, S, T, T, E, S, T 4 + 5 + 5 + 3 + 1 + 3 + 3 + 1 = 25
E
9
9
D. D. Sleator, and R. E. Tarjan (1985), Amortized efficiency of list update and paging rules. Communications of the ACM 28, 202–208. www.cs.cmu.edu/~sleator/papers/amortized-efficiency.pdf T. Ottmann und P. Widmayer (2002), Algorithmen und Datenstrukturen. Kapitel 3.3: Selbstanordnende lineare Listen.
9 O
) ) )
O
