首次适应算法最佳适应算法最坏适应算法.docx

#includeiostream.h#includestdlib.h

#define

Free

0

//???D×′ì?

#define

Busy

1

//ò?ó?×′ì?

#define

OK1

//íê3é

#defineERROR0//3?′í

#defineMAX_length640//×?′ó?ú′??????a640KBtypedefintStatus;

intflag;

typedefstructfreearea//?¨ò?ò??????D???μ?÷±í?á11

{

longsize; //·???′óD?longaddress;//·???μ??·intstate; //×′ì?

}ElemType;

//??D?±íμ????òá′±í′?′￠?á11typedefstructDuLNode

{

ElemTypedata;

structDuLNode*prior;//?°?÷????structDuLNode*next; //oó?ì????

}

DuLNode,*DuLinkList;

DuLinkListblock_first;//í·?áμ?DuLinkListblock_last; //?2?áμ?Statusalloc(int);//?ú′?·???Statusfree(int);//?ú′???ê?

StatusFirst_fit(int);//ê×′?êêó|??·¨StatusBest_fit(int);//×???êêó|??·¨StatusWorst_fit(int);//×?2?êêó|??·¨voidshow();//2é?′·???

StatusInitblock();//?a′′????±í

StatusInitblock()//?a′′′?í·?áμ?μ??ú′?????á′±í

{

block_first=(DuLinkList)malloc(sizeof(DuLNode));block_last=(DuLinkList)malloc(sizeof(DuLNode));block_first-prior=NULL;

block_first-next=block_last;block_last-prior=block_first;

block_last-next=NULL;block_last-data.address=0;

block_last-data.size=MAX_length;block_last-data.state=Free;returnOK;

}

//·????÷′?

Statusalloc(intch)

{

intrequest=0;cout??ê?è?Dèòa·???μ??÷′?′óD?(μ￥??:KB)￡o;cinrequest;

if(request0||request==0)

{

cout·???′óD?2?o?êê￡?????ê?￡?endl;returnERROR;

}

if(ch==2)//????×???êêó|??·¨

{

if(Best_fit(request)==OK)cout·???3é1|￡?endl;elsecout?ú′?2?×?￡?·???꧰ü￡?endl;

returnOK;

}

if(ch==3)//????×?2?êêó|??·¨

{

if(Worst_fit(request)==OK)cout·???3é1|￡?endl;elsecout?ú′?2?×?￡?·???꧰ü￡?endl;

returnOK;

}

else//??è?ê×′?êêó|??·¨

{

if(First_fit(request)==OK)cout·???3é1|￡?endl;elsecout?ú′?2?×?￡?·???꧰ü￡?endl;

returnOK;

}

}

//ê×′?êêó|??·¨

StatusFirst_fit(intrequest)

{

//?aéê??×÷òμ?a±ùD??????ò3?ê??ˉ

DuLinkListtemp=(DuLinkList)malloc(sizeof(DuLNode));

temp-data.size=request;temp-data.state=Busy;

DuLNode*p=block_first-next;while(p)

{

if(p-data.state==Freep-data.size==request)

{//óD′óD???o?o?êêμ????D?ép-data.state=Busy;ret