Least Recently Used (LRU) Algorithm
The Least Recently Used (LRU) algorithm is a cache replacement policy that evicts the least recently used items first.
3 docs tagged with "Cache"
सारे टैग देखेंLRU Cache
Least Recently Used Cache implementation using HashMap and Doubly Linked List providing O(1) time complexity for both get and put operations.
LRU Cache
A complete guide to LRU (Least Recently Used) Cache -- a caching strategy using doubly linked lists and hash maps to achieve O(1) get and put operations.