前言

大家放實(shí)驗(yàn)報(bào)告里面的時(shí)候，好歹要把變量名什么的改改吧。。。一模一樣的給老師發(fā)現(xiàn)就不好了。。。

---

代碼

#include <iostream> #include <algorithm>#define MAX 10000 using namespace std;//求平均尋道長(zhǎng)度 double average(int *length, int n) {double sum=0;for(int i= 0;i<n;i++)sum+=length[i];return sum/n; }//求移動(dòng)赤道總數(shù) double sum(int* length, int n) {double sum_=0;for(int i= 0;i<n;i++)sum_+=length[i];return sum_; }void FCFS(int *a, int n, int now) {int t=n;int start = now;int k=0;int next[MAX], length[MAX]; //next數(shù)組存放訪問(wèn)序列，length存放每次訪問(wèn)所移動(dòng)的磁道數(shù)int visit[MAX]={0}; //標(biāo)記某個(gè)赤道是否已被訪問(wèn)過(guò)for(int i = 0;i < n;i++) {length[k] = abs(a[i] - now);next[k++] = a[i];now = a[i];}cout <<"\n磁道移動(dòng)軌跡\n";cout << start <<" ";for(int i=0;i<n;i++)cout<<next[i]<<" ";cout <<endl;cout <<"移動(dòng)磁道數(shù) ="<<sum(length,n)<<endl;cout <<"平均尋道長(zhǎng)度 = "<<average(length,n)<<endl; }void SSTF(int *a, int n, int now) {int k = 0;int t = n;int start = now;int flag = 0; //最短路徑下標(biāo)int next[MAX], length[MAX], visit[MAX]={0};while(t--){int min=999999; //最短路徑for(int i=0;i<n;i++){if(visit[i])continue;if(abs(a[i]-now)<min){min = abs(a[i]-now);flag = i;}}length[k]=min;next[k++] = a[flag];visit[flag]=1;now = a[flag];}cout <<"\n磁道移動(dòng)軌跡\n";cout<<start<<" ";for(int i=0;i<n;i++)cout<<next[i]<<" ";cout <<endl;cout <<"移動(dòng)磁道數(shù) ="<<sum(length,n)<<endl;cout <<"平均尋道長(zhǎng)度 = "<<average(length,n)<<endl; }void SCAN(int *a, int n, int now) {int flag=0,k=0;int start = now;int next[MAX], length[MAX];int b[MAX] = {0}; //替代a數(shù)組，否則下面的sort()會(huì)改變數(shù)組afor(int i=0;i<n;i++)b[i] = a[i];sort(b,b+n); //數(shù)組內(nèi)部排序for(int i=0;i<n;i++){if(b[i]>now){flag = i;break;}}//往遞增方向for(int i = flag; i<n;i++){next[k] = b[i];length[k++] = abs(b[i] - now);now = b[i];}//返回往遞減方向for(int i=flag-1;i>=0;i--){next[k] = b[i];length[k++] = abs(b[i] - now);now = b[i];}cout <<"\n磁道移動(dòng)軌跡\n";cout<<start<<" ";for(int i=0;i<n;i++)cout<<next[i]<<" ";cout <<endl;cout <<"移動(dòng)磁道數(shù) ="<<sum(length,n)<<endl;cout <<"平均尋道長(zhǎng)度 = "<<average(length,n)<<endl; }int main() {int a[MAX]; //存放要用到的磁道號(hào)int start; //開(kāi)始磁道int n,flag =1 ;cout << "磁道數(shù)：";cin >> n;cout <<"磁道序列：";srand((int)time(0));for(int i=0;i<n;i++){a[i] = rand()%1001; //磁道序列序號(hào)0～1000cout << a[i]<<" ";}cout <<endl;cout <<"開(kāi)始時(shí)的磁道：";cin >>start;//磁盤調(diào)度目錄while(flag){cout<<"請(qǐng)選一種磁盤調(diào)度算法："<<endl;;cout<<"1.先來(lái)先服務(wù)尋道算法"<<endl;cout<<"2.最短尋道時(shí)間優(yōu)先"<<endl;cout<<"3.掃描算法"<<endl;cout<<"0.退出"<<endl;cin>>flag;switch(flag){case 1:FCFS(a,n,start);break;case 2:SSTF(a, n, start);break;case 3:SCAN(a, n, start);break;case 0:break;}}return 0; }

代碼比較簡(jiǎn)單，只是能體現(xiàn)這三個(gè)算法的原理罷了。

總結(jié)

以上是生活随笔為你收集整理的磁盘调度 FCFS、SSTF、SCAN 算法c++实现（大学生专用）的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。