Not frequently used (NFU) (Online Page Replacements): Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "== Time Complexity == $O(nk)$? == Space Complexity == $O(k)$ words (Need to keep track of cache + reference counters only) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference ==")
 
(No difference)

Latest revision as of 12:17, 15 February 2023

Time Complexity

$O(nk)$?

Space Complexity

$O(k)$ words

(Need to keep track of cache + reference counters only)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

1940

Reference