最先（FIFO）适应算法、最优适应算法、最坏适应算法、循环最适应算法。C++实现。操作系统实验-连续储存分配管理。

[{"title":"（ 9 个子文件 414KB ） 最先（FIFO）适应算法、最优适应算法、最坏适应算法、循环最适应算法。C++实现。操作系统实验-连续储存分配管理。","children":[{"title":"bin","children":[{"title":"Debug","children":[{"title":"work9.exe <span style='color:#111;'> 1.51MB </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"work9.cbp <span style='color:#111;'> 1.04KB </span>","children":null,"spread":false},{"title":"obj","children":[{"title":"Debug","children":[{"title":"main.o <span style='color:#111;'> 29.91KB </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":"全代码文本.txt <span style='color:#111;'> 9.63KB </span>","children":null,"spread":false},{"title":"work9.depend <span style='color:#111;'> 168B </span>","children":null,"spread":false},{"title":"a.txt <span style='color:#111;'> 48B </span>","children":null,"spread":false},{"title":"main.cpp <span style='color:#111;'> 8.94KB </span>","children":null,"spread":false},{"title":"work9.layout <span style='color:#111;'> 599B </span>","children":null,"spread":false},{"title":"说明.c <span style='color:#111;'> 212B </span>","children":null,"spread":false}],"spread":true}]