LRU cache design

Posted by user297850 on Stack Overflow See other posts from Stack Overflow or by user297850
Published on 2010-03-23T22:48:53Z Indexed on 2010/03/23 22:53 UTC
Read the original article Hit count: 538

Least Recently Used (LRU) Cache is to discard the least recently used items first How do you design and implement such a cache class? The design requirements are as follows: 1) find the item as fast as we can 2) Once a cache misses and a cache is full, we need to replace the least recently used item as fast as possible.

How to analyze and implement this question in terms of design pattern and algorithm design?

© Stack Overflow or respective owner

Related posts about algorithm

Related posts about data-structures