#include <stdio.h>
#include <math.h>
#include <iostream>
#include <string>
#include <iomanip>
using namespace::std;
struct track{
int tracknum;
bool time;//计数器
};
void Sort(int *a,int n)
{
for (int i = 0; i < n; i++)
{
for (int j = i+1; j < n; j++)
{
if (a[j] < a[i]){
int temp=a[j];a[j]=a[i];a[i]=temp;
}
}
}
}
void SCAN(int n,track *a,int begin){
track b[100];
for (int i=0; i<n; i++) {
b[i].tracknum=a[i].tracknum;
b[i].time=a[i].time;
}
int n1=0,n2=0;
double sum=0,average=0;
int move;
int c[100],d[100];
for(int i=0;i<n;i++){
if(b[i].tracknum<begin){
c[n1]=b[i].tracknum;
n1++;
}
else{
d[n2]=b[i].tracknum;
n2++;
}
b[i].time=false;
}
Sort(c,n1);
Sort(d,n2);
cout<<"next | move"<<endl;
for(int i=0;i<n2;i++){
move=d[i]-begin;
begin=d[i];
cout<<d[i]<<" "<<move<<endl;
sum+=move;
}
for(int i=n1-1;i>=0;i--){
move=abs(c[i]-begin);
begin=c[i];
cout<<c[i]<<" "<<move<<endl;
sum+=move;
}
average=sum/n;
cout<<"the average is:"<<average<<setprecision(2)<<endl;
}
int showdetail(int n,track *a,int begin){
for (int i =0; i<n; i++) {
cout<<a[i].tracknum<<endl;
}
cout<<"the start is:"<<begin<<endl;
return 0;
}
int change(int n,track *a,int changetracknum,int changetracknumto){
for (int i=0; i<n; i++) {
if (changetracknum==a[i].tracknum) {
a[i].tracknum=changetracknumto;
}
}
return 0;
}
int main(){
int i;
int flag=1;
cout<<"please input the start:"<<endl;
int begin=0;
cin>>begin;
int n;
track a[100];
cout<<"please input the number of track:"<<endl;
cin>>n;
cout<<"please input the tracks:"<<endl;
for(i=0;i<n;i++){
cin>>a[i].tracknum;
a[i].time=true;
}
while (flag) {
string input;
cout<<"please input next action:"<<endl;
cin>>input;
if (input=="run") {
SCAN(n,a,begin);
}
else if (input=="changebegin") {
int newbegin;
cout<<"please input new begin:"<<endl;
cin>>newbegin;
begin=newbegin;
SCAN(n,a,begin);
}
else if (input=="changetrack") {
int changetracknum;
int changetracknumto;
cout<<"please input the tracknum want to change and changeto"<<endl;
cin>>changetracknum;
cin>>changetracknumto;
change(n,a,changetracknum,changetracknumto);
SCAN(n,a,begin);
}
else if (input=="showdetail"){
showdetail(n,a,begin);
}
else if (input=="exit") {
flag=0;
}
}
return 0;
}
SCAN 磁盘调度模拟实现
最新推荐文章于 2021-07-08 12:24:26 发布