}
//回收内存算法： /*
有共计八种情况，1.（1）回收区上邻接着空闲盘块，下连接着已分配盘块 （2）回收区下邻接着空闲盘块，上邻接着已分配盘块 (3)回收区上下连接的都是空闲盘块 （4)空闲区上下邻接的都是已分配盘块
（5）要回收的盘块就是第一个盘块，并且向下邻接着空闲盘块 (6)要回收的盘块就是第一个盘块，但是向下邻接着已分配盘块 (7)要回收的盘块就是最后一个盘块，并且向上邻接的是空闲盘块 (8)要回收的盘块就是最后一个盘块，但是向上邻接的是已分配盘块 */
void apply_recycle() {
ary1[0][1]=ary1[0][1]+ary1[1][1]; ary1[0][3]=0; for(i=1;i 16 if(recycle==1) { //cout< if(ary1[1][3]!=2) { cout<<\要回收的盘块就是第一个盘块，并且向下邻接着空闲盘块\stream.open(\ int i; int j; int k; if(m==1) { } else { ary1[0][3]=0; n++; ary2[0][0]=1; ary2[0][1]=ary1[0][1]; ary2[0][2]=ary1[0][2]; vision(); } stream<<\要回收的盘块就是第一个盘块，并且向下邻接着空闲盘块\ stream.close(); ary2[k][0]=ary1[j][0]; 17 ary1[0][3]=0; k=0; for(j=0;j //cout<<\if(ary1[j][3]!=2) { } else{ cout<<\要回收的盘块就是第一个盘块，但是向下邻接着已分配盘块\ } n=k; vision(); } ary2[k][0]=ary1[j][0]; ary2[k][1]=ary1[j][1]; ary2[k][2]=ary1[j][2]; k++; { } m--; // cout<<\k=0; vision(); //cout<<\//cout<<\//cout<<\//cout<<\for(j=0;j cout<<\if(ary1[j][3]!=2) { ary1[i][0]=ary1[i+1][0]-1; ary1[i][1]=ary1[i+1][1]; ary1[i][2]=ary1[i+1][2]; ary1[i][3]=ary1[i+1][3]; //cout<<\ stream.open(\ stream<<\要回收的盘块就是第一个盘块，但是向下邻接着已分配盘块\ stream.close(); 18 } else{ cout<<\要回收的盘块就是最后一个盘块，但是向上邻接的是已分配盘块\stream.open(\ } n=k; vision(); } ary2[k][0]=ary1[j][0]; ary2[k][1]=ary1[j][1]; ary2[k][2]=ary1[j][2]; k++; ary1[recycle-2][3]=0; ary1[recycle-2][1]=ary1[recycle-2][1]+ary1[recycle-1][1]; m--; k=0; for(j=0;j //cout<<\if(ary1[j][3]!=2) { } else if(recycle==m) { if(ary1[recycle-2][3]!=2) { cout<<\要回收的盘块就是最后一个盘块，并且向上邻接的是空闲盘块\stream.open(\} } n=k; vision(); } ary2[k][1]=ary1[j][1]; ary2[k][2]=ary1[j][2]; k++; stream<<\要回收的盘块就是最后一个盘块，并且向上邻接的是空闲盘块\ stream.close(); stream<<\要回收的盘块就是最后一个盘块，但是向上邻接的是已分配盘块\ stream.close(); ary2[k][0]=ary1[j][0]; ary2[k][1]=ary1[j][1]; ary2[k][2]=ary1[j][2]; k++; 19 } else{//剩下比较复杂的四种情况 if((ary1[recycle-2][3]!=2)&&(ary1[recycle][3]==2))//回收区上邻接着空闲盘块，下连接着{cout<<\回收区上邻接着空闲盘块，下连接着已分配盘块\stream.open(\ } } n=k; vision(); } ary2[k][0]=ary1[j][0]; ary2[k][1]=ary1[j][1]; ary2[k][2]=ary1[j][2]; k++; ary1[recycle-1][3]=0; k=0; for(j=0;j //cout<<\if(ary1[j][3]!=2) { 已分配盘块 stream<<\回收区上邻接着空闲盘块，下连接着已分配盘块\ stream.close(); ary1[recycle-2][1]=ary1[recycle-2][1]+ary1[recycle-1][1]; for(i=recycle-1;i for(j=0;j //cout<<\if(ary1[j][3]!=2) { ary1[i][0]=ary1[i+1][0]-1; ary1[i][1]=ary1[i+1][1]; ary1[i][2]=ary1[i+1][2]; ary1[i][3]=ary1[i+1][3]; } if((ary1[recycle-2][3]!=2)&&(ary1[recycle][3]!=2))//回收区上下连接的都是空闲盘块 { cout<<\回收区上下连接的都是空闲盘块\stream.open(\ } vision(); } ary2[k][0]=ary1[j][0]; ary2[k][1]=ary1[j][1]; ary2[k][2]=ary1[j][2]; k++; } n=k; vision(); } if((ary1[recycle][3]!=2)&&(ary1[recycle-2][3]==2))//回收区下邻接着空闲盘块，上邻接着{ cout<<\回收区下邻接着空闲盘块，上邻接着已分配盘块\stream.open(\} 已分配盘块 stream<<\回收区下邻接着空闲盘块，上邻接着已分配盘块\ stream.close(); ary1[recycle-2][3]=0; ary1[recycle-2][1]=ary1[recycle-2][1]+ary1[recycle-1][1]; for(i=recycle-1;i for(j=0;j //cout<<\if(ary1[j][3]!=2) { ary1[i][0]=ary1[i+1][0]-1; ary1[i][1]=ary1[i+1][1]; ary1[i][2]=ary1[i+1][2]; ary1[i][3]=ary1[i+1][3]; n=k; stream<<\回收区下邻接着空闲盘块，上邻接着已分配盘块\ stream.close(); ary1[recycle-2][1]=ary1[recycle-2][1]+ary1[recycle-1][1]+ary1[recycle][1]; 20