十大题型算法全实现——（七）磁盘调度[5]

p=j;

flag=abs(queue[j]gocurrent);

}

}

}

if(p!=){

cout<

//磁头初始向外

for(i=0;i

queue[i].visited=0;

}

total=0;

cout<<"磁头初始向外的访问磁道号顺序流:";

current=start;

for(i=0;i

flag=1000;

p=-1;

for(j=0;j

if((queue[j].visited==0)&&(queue[j].go<=current)){

if(abs(queue[j].go-current)

p=j;

flag=abs(queue[j].go-current);

}

}

}

if(p!=-1){

cout<

}

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