动态分区分配与回收算法实验报告

hile(p)?{ if(p->data.num==num) { p->data.state=FREE; p->data.num=0; if(p->head->data.state==FREE)//与前一块空闲区相邻,则合并{ p->head->data.size+=p->data.size; p->head->next=p->next; p->next->head=p->head; } if(p->next->data.state==FREE)//与后一块空闲区相邻,则合并{ p->data.size+=p->next->data.size; p->next->next->head=p; p->next=p->next->next; } break; } p=p->next;?}?display();?return1;}voidmenu(){?cout<<"********************内存分配系统********************"<<endl;?cout<<"1.首次适应算法分配内存"<<endl;?cout<<"2.最佳适应算法分配内存"<<endl;?cout<<"3.查看主存分配情况"<<endl;?cout<<"4.回收主存"<<endl;?cout<<"请选择:"<<endl;}voidmain(){?init();?intchoose;?menu();?while(1)?{ //menu(); cin>>choose; switch(choose) { case1: firstAlloc(); break; case2: bestAlloc(); break; case3: display(); break; case4: recycle(); break; default: cout<<"输入错误!"<<endl; break; }?}}