SCAN 磁盘调度模拟实现

#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;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值