← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

15 第15章 贪心算法

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.702Z

uivalently, to maximize the number of cache hits, over the entire sequence of n requests.

A cache miss that occurs while the cache holds fewer than k blocks—that is, as the cache is first being filled up—is known as a compulsory miss, since no prior decision could have kept the requested block in the cache.

When a cache miss occurs and the cache is full, ideally the choice of which block to evic

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter015.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea