说明：  LRU算法的实现 5、最近最久未使用页面算法说明： M为内存块； N为页面数； M和N的初始值分别为3和15。根据需要可以修改宏定义来修改M和N的值。 通过输入15个数值，作为页面号。 产生内存状态，显示调入的队列，并计算出缺页数和缺页率。
(LRU Algorithm 5, the most recent long algorithm using the Page Description: M for the memory block N for a few pages M and N of the initial value of 3 and 15, respectively. Macro can be modified as needed to modify the definition of M and N values. By entering the value 15, as a page number. Have a memory state, indicating the redeployment of the queue, and calculating the vacancy rate in the number of pages and pages missing.)