#include #include #define M 20 #define N 3 int mm[M]={0,0,0,2,3,1,0,4,2,3,2,1,0,3,2,2,1,3,0,1}; int nn[N]; int number; void Xunhuan(void); void FIFO(void); void Best(void); void LRU(void); int main() { char ss[1]; int i,j, *p=nn; int c, k=0; for(i=0;

LRU-k是一个在LRU基础上进行提升的算法，在处理数据队列时，使用了更有效的优先级计算方法-LRU-K is a advanced algorithm based on LRU. It computes the priorities of the data items more accurately and avoid some occasional cases.