最坏适应算法.txt

最坏适应算法 可变分区调度算法有:最先适应分配算法,最优适应分配算法,最坏适应算法

//最坏适应算法 
void worst() 
{ 
char job_name[20]; 
int job_length; 
int i,j,flag,t; 

cout<<"请输入新申请内存空间的作业名和空间大小:"; 
cin>>job_name; 
cin>>job_length; 

flag=0; 
for(i=0;i<free_quantity;i++){ 
if(frees[i].length>=job_length){ 
flag=1; 
} 
} 
if(flag==0){ 
cout<<endl<<"Sorry,当前没有能满足你申请长度的空闲内存,请稍候再试"<<endl; 
} 
else{ 
t=0; 
i=0; 
while(t==0){ 
if(frees[i].length>=job_length){ 
t=1; 
} 
i++; 
} 
i--; 
for(j=0;j<free_quantity;j++){ 
if((frees[j].length>=job_length)&&(frees[j].length>frees[i].length)){ 
i=j; 
} 
} 

occupys[occupy_quantity].start=frees[i].start; 
strcpy(occupys[occupy_quantity].tag,job_name); 
occupys[occupy_quantity].length=job_length; 
occupy_quantity++; 

if(frees[i].length>job_length){ 
frees[i].start+=job_length; 
frees[i].length-=job_length; 
} 
else{ 
for(j=i;j<free_quantity-1;j++){ 
frees[j]=frees[j+1]; 
} 
free_quantity--; 
cout<<"内存空间成功:)"<<endl; 
} 
} 
}