How does cache eviction work?

Can you explain how cache eviction works?

Sure! Cache eviction is the process of removing items from a cache to make space for new data. It helps manage memory efficiently.

What are some common cache eviction policies?

Some common policies include Least Recently Used (LRU), First In First Out (FIFO), and Least Frequently Used (LFU). Each has its own advantages.

How does LRU work specifically?

LRU keeps track of the order in which items are accessed. When the cache is full, it evicts the least recently accessed item.

Are there any downsides to using LRU?

Yes, LRU can be expensive in terms of time complexity, especially if the data structure used to track access order is not efficient.