ALL > Computer and Education > courses > university courses > undergraduate courses > Operating System > ZSTU-(2020-2021)-1 > student homework > 2018329621265_卢子奕 >
Homework12 Version 0
👤 Author: by 1224532347qqcom 2021-01-01 07:39:49


void FCFS()
{
cout<<"******* 你选择了FCFS算法 ***********************************"<<endl;
initial();

MoveDistance[0] = getPositive(TrackOrder[0],StartTrack);
totalDistance = MoveDistance[0];
VisitOrder[0] = TrackOrder[0];

for (int i=1;i<TrackNum;i++)
{
MoveDistance[i] = getPositive(TrackOrder[i],TrackOrder[i-1]);
totalDistance += MoveDistance[i];

VisitOrder[i] = TrackOrder[i];
}

AverageDistance = totalDistance*1.0/TrackNum;
display();

cout<<"******* FCFS算法结束 ***********************************"<<endl;
}

Please login to reply. Login

Reversion History

Loading...
No reversions found.