十大题型算法全实现——（五）磁盘存储空间的管理[4]

else{

cout<<==================================================<

cout<<"读入的初始空闲块号:";

while(!feof(fp)){

fscanf(fp,"%d ",&temp);

if(head->quantity

head->cell[head->quantity]=temp;

head->quantity++;

}

else{

p=initial();

p->next=head;

head=p;

p->cell[p->quantity]=temp;

p->quantity++;

}

total++;

//输出初始数据

cout<

}

}

//查看专用块函数

void view()

{

int i;

cout<

cout<<"-------------------------------"<

cout<<"所存储的空闲块号:";

for(i=0;iquantity;i++){

cout<cell[i]<<" ";

}

cout<quantity;

cout<

}

//新申请函数

void bid()

{

char jobname[20];

int number;

int i;

job *p;

cout<<"----------------------------------"<

cout<<"请输入新专业名:";

[1] [2] [3] [4] [5] [6] [7] [8]