+1 (218) 451-4151
glass
pen
clip
papers
heaphones

1. Describe an efficient method for maintaining a favorites list L, with the move-tofront…

1. Describe an efficient method for maintaining a favorites list L, with the move-tofront…

1. Describe an efficient method for maintaining a favorites list L, with the move-tofront heuristic, such that elements that have not been accessed in the most recent n accesses are automatically purged from the list.2. Suppose we have an n-element list L maintained according to the move-to-front heuristic. Describe a sequence of n2 accesses that is guaranteed to take Ω(n3) time to perform on L.