用c语言写出页面置换算法，要求能输入序列长度和物理块数，使用LRU 算法和FIFO算法

下面是使用C语言实现LRU算法和FIFO算法的页面置换程序，可以根据输入的序列长度和物理块数进行模拟：

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

//定义页面块的结构体
typedef struct PageBlock {
    int id;
    int time;
} PageBlock;

//初始化页面块
void initPageBlock(PageBlock* pageBlock, int blockNum) {
    for (int i = 0; i < blockNum; i++) {
        pageBlock[i].id = -1;
        pageBlock[i].time = 0;
    }
}

//查找指定页面块是否在内存中
bool findPageBlock(PageBlock* pageBlock, int blockNum, int id) {
    for (int i = 0; i < blockNum; i++) {
        if (pageBlock[i].id == id) {
            return true;
        }
    }
    return false;
}

//更新页面块的时间戳
void updateTime(PageBlock* pageBlock, int blockNum) {
    for (int i = 0; i < blockNum; i++) {
        pageBlock[i].time++;
    }
}

//获取最久未使用的页面块的索引
int getLRU(PageBlock* pageBlock, int blockNum) {
    int minTime = pageBlock[0].time;
    int index = 0;
    for (int i = 1; i < blockNum; i++) {
        if (pageBlock[i].time < minTime) {
            minTime = pageBlock[i].time;
            index = i;
        }
    }
    return index;
}

//FIFO算法页面置换
void FIFO(int* sequence, int seqLen, int blockNum) {
    int pageFault = 0;
    PageBlock* pageBlock = (PageBlock*)malloc(sizeof(PageBlock) * blockNum);
    initPageBlock(pageBlock, blockNum);
    for (int i = 0; i < seqLen; i++) {
        if (!findPageBlock(pageBlock, blockNum, sequence[i])) {
            int index = -1;
            for (int j = 0; j < blockNum; j++) {
                if (pageBlock[j].id == -1) {
                    index = j;
                    break;
                }
            }
            if (index == -1) {
                index = i % blockNum;
            }
            pageBlock[index].id = sequence[i];
            pageBlock[index].time = 0;
            pageFault++;
        }
        updateTime(pageBlock, blockNum);
    }
    printf("FIFO算法页面缺页次数为：%d\n", pageFault);
    free(pageBlock);
}

//LRU算法页面置换
void LRU(int* sequence, int seqLen, int blockNum) {
    int pageFault = 0;
    PageBlock* pageBlock = (PageBlock*)malloc(sizeof(PageBlock) * blockNum);
    initPageBlock(pageBlock, blockNum);
    for (int i = 0; i < seqLen; i++) {
        if (!findPageBlock(pageBlock, blockNum, sequence[i])) {
            int index = -1;
            for (int j = 0; j < blockNum; j++) {
                if (pageBlock[j].id == -1) {
                    index = j;
                    break;
                }
            }
            if (index == -1) {
                index = getLRU(pageBlock, blockNum);
            }
            pageBlock[index].id = sequence[i];
            pageBlock[index].time = 0;
            pageFault++;
        }
        updateTime(pageBlock, blockNum);
    }
    printf("LRU算法页面缺页次数为：%d\n", pageFault);
    free(pageBlock);
}

int main() {
    int seqLen, blockNum;
    printf("请输入序列长度和物理块数：");
    scanf("%d%d", &seqLen, &blockNum);
    int* sequence = (int*)malloc(sizeof(int) * seqLen);
    printf("请输入序列：");
    for (int i = 0; i < seqLen; i++) {
        scanf("%d", &sequence[i]);
    }
    FIFO(sequence, seqLen, blockNum);
    LRU(sequence, seqLen, blockNum);
    free(sequence);
    return 0;
}

这个程序首先从用户处输入序列长度和物理块数，然后输入序列后，使用FIFO和LRU算法进行页面置换，并输出缺页次数。