2022年首次适应算法,最佳适应算法,最坏适应算法 .pdf

《2022年首次适应算法,最佳适应算法,最坏适应算法 .pdf》由会员分享，可在线阅读，更多相关《2022年首次适应算法,最佳适应算法,最坏适应算法 .pdf（8页珍藏版）》请在淘文阁 - 分享文档赚钱的网站上搜索。

1、#include #include #define Free 0 /?D ? #define Busy 1 /? ? #define OK 1 / 3 #define ERROR 0 /3? #define MAX_length 640 /? ? ?a640KB typedef int Status; int flag; typedef struct freearea/? ?D? ?11 long size; /? D? long address; /? int state; / ? ElemType; / ?D? ? ?11 typedef struct DuLNode ElemType d

2、ata; struct DuLNode *prior; /? struct DuLNode *next; /o? DuLNode,*DuLinkList; DuLinkList block_first; / ? ? DuLinkList block_last; /?2? ? Status alloc(int);/? ? Status free(int); /? ? Status First_fit(int);/ ? |? Status Best_fit(int); /? |? Status Worst_fit(int); /?2? |? void show();/2? ? Status Ini

3、tblock();/?a ? Status Initblock()/?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; 名师资料总结 - - -精品资料欢迎下载 - - - - - - - - - - - - - - - - - - 名师精心整理 - - - - - - -

4、 第 1 页，共 8 页 - - - - - - - - - block_last-next=NULL; block_last-data.address=0; block_last-data.size=MAX_length; block_last-data.state=Free; return OK; / ? ? Status alloc(int ch) int request = 0; coutrequest; if(request0 |request=0) cout? D?2?o? ?endl; return ERROR; if(ch=2) /? |? if(Best_fit(reques

5、t)=OK) cout?31| ?endl; else cout? ?2? ?endl; return OK; if(ch=3) /?2? |? if(Worst_fit(request)=OK) cout?31| ?endl; else cout? ?2? ?endl; return OK; else /? ? |? if(First_fit(request)=OK) cout?31| ?endl; else cout? ?2? ?data.size=request; temp-data.state=Busy; DuLNode *p=block_first-next; while(p) if

6、(p-data.state=Free & p-data.size=request) /D D?o?o? ?D? p-data.state=Busy; return OK; break; if(p-data.state=Free & p-data.sizerequest) /D?D? ? ?D? D temp-prior=p-prior; temp-next=p; temp-data.address=p-data.address; p-prior-next=temp; p-prior=temp; p-data.address=temp-data.address+temp-data.size; p

7、-data.size-=request; return OK; break; p=p-next; return ERROR; / ? |? Status Best_fit(int request) int ch; /?D? ? DuLinkList temp=(DuLinkList)malloc(sizeof(DuLNode); temp-data.size=request; temp-data.state=Busy; DuLNode *p=block_first-next; DuLNode *q=NULL; /?2? while(p) /3? ?D?o ? if(p-data.state=F

8、ree & (p-data.size=request) ) if(q=NULL) 名师资料总结 - - -精品资料欢迎下载 - - - - - - - - - - - - - - - - - - 名师精心整理 - - - - - - - 第 3 页，共 8 页 - - - - - - - - - q=p; ch=p-data.size-request; else if(q-data.size p-data.size) q=p; ch=p-data.size-request; p=p-next; if(q=NULL) return ERROR;/?D? ?D? else if(q-data.si

9、ze=request) q-data.state=Busy; return OK; else temp-prior=q-prior; temp-next=q; temp-data.address=q-data.address; q-prior-next=temp; q-prior=temp; q-data.address+=request; q-data.size=ch; return OK; return OK; / ?2? |? Status Worst_fit(int request) int ch; /? DuLinkList temp=(DuLinkList)malloc(sizeo

10、f(DuLNode); temp-data.size=request; temp-data.state=Busy; DuLNode *p=block_first-next; DuLNode *q=NULL; /?2? while(p) /3? ? ?o ? 名师资料总结 - - -精品资料欢迎下载 - - - - - - - - - - - - - - - - - - 名师精心整理 - - - - - - - 第 4 页，共 8 页 - - - - - - - - - if(p-data.state=Free & (p-data.size=request) ) if(q=NULL) q=p;

11、ch=p-data.size-request; else if(q-data.size data.size) q=p; ch=p-data.size-request; p=p-next; if(q=NULL) return ERROR;/?D? ?D? else if(q-data.size=request) q-data.state=Busy; return OK; else temp-prior=q-prior; temp-next=q; temp-data.address=q-data.address; q-prior-next=temp; q-prior=temp; q-data.ad

12、dress+=request; q-data.size=ch; return OK; return OK; /? ? Status free(int flag) DuLNode *p=block_first; for(int i= 0; i next; 名师资料总结 - - -精品资料欢迎下载 - - - - - - - - - - - - - - - - - - 名师精心整理 - - - - - - - 第 5 页，共 8 页 - - - - - - - - - else return ERROR; p-data.state=Free; if(p-prior!=block_first & p

13、-prior-data.state=Free)/?D? ? p-prior-data.size+=p-data.size; p-prior-next=p-next; p-next-prior=p-prior; p=p-prior; if(p-next!=block_last & p-next-data.state=Free)/?o?D? ? p-data.size+=p-next-data.size; p-next-next-prior=p; p-next=p-next-next; if(p-next=block_last & p-next-data.state=Free)/?o ?D? ?

14、p-data.size+=p-next-data.size; p-next=NULL; return OK; /? ? ? void show() int flag = 0; coutn? ?:n; coutnext; cout ?o?t?e ?t ? D?t ?nn; while(p) cout flag+t; cout data.addresstt; cout data.sizedata.state=Free) cout?Dnn; else coutnext; cout+nn; /? o y void main() int ch;/? ? ? cout? 1? ? on; coutch;

15、while(ch3) coutch; Initblock(); /?a ? int choice; /2 ? ? while(1) show(); cout? ? ?2 o; coutchoice; if(choice=1) alloc(ch); / ? ? else if(choice=2) / ? ? int flag; coutflag; free(flag); else if(choice=0) break; /?3? else /?2 D? cout?D? ?endl; continue; 名师资料总结 - - -精品资料欢迎下载 - - - - - - - - - - - - - - - - - - 名师精心整理 - - - - - - - 第 7 页，共 8 页 - - - - - - - - - 名师资料总结 - - -精品资料欢迎下载 - - - - - - - - - - - - - - - - - - 名师精心整理 - - - - - - - 第 8 页，共 8 页 - - - - - - - - -