原书出处
Introduction to Algorithms, Fourth Edition
15 第15章 贪心算法
know the future requests, and so they often use the past to decide which block to evict.
The least-recently-used, or LRU, strategy evicts the block that, of all blocks currently in the cache, was the least recently requested.
(You can think of LRU as “furthest-in-past.”) Give an example of a request sequence in wh
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter015.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea