Describe an efficient method for maintaining a favorites list L , with moveto- front heuristic, such that elements that have not been accessed in the most recent n accesses are automatically purged...

Describe an efficient method for maintaining a favorites list
L, with moveto-

front heuristic, such that elements that have not been accessed in the

most recent
n
accesses are automatically purged from the list.

Exercise C-5.29 introduces the notion of a

natural join

of two databases.

Describe and analyze an efficient algorithm for computing the natural join

of a linked list
A
of
n
pairs and a linked list
B
of
m
pairs.