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

for(i=;i

p=0;

while(queue[p].visited!=0){

p++;

}

for(j=p;j

if((queue[j].visited==0)&&(abs(current-queue[p].go)>abs(current-queue[j].go))){

p=j;

}

}

cout<

}

//电梯算法

void elevator()

{

int i,j,p,flag;

int total=0;

int current;

cout<

cout<<"电梯调度算法"<

//磁头初始向里

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)

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