Write a simple implementation of an LRU (Least Recently Used) cache with a given capacity. If the
Fantastic news! We've Found the answer you've been seeking!
Question:
- Write a simple implementation of an LRU (Least Recently Used) cache with a given capacity. If the cache is full, the least recently used item should be evicted when adding a new item.
Related Book For
Computer Organization And Architecture Themes And Variations
ISBN: 9781111987046
1st Edition
Authors: Alan Clements
Posted Date: