磁盘调度文库.docVIP

#include iostream.h #include math.h struct jop { char name; int num; }; void intput_Rec(struct jop *p) { cinp-name; cinp-num; } void swap_Rec(struct jop *p1,struct jop *p2) { struct jop x; x=*p1; *p1=*p2; *p2=x; } void put_Rec(struct jop *p) { coutp-name\t; coutp-numendl; } void FCFS(int mid,struct jop a[]) { cout*****FCFS*****endl; int i; int sum=0; for(i=0;i11;i++) { mid=abs(a[i].num-mid); sum+=mid; couta[i].name ; couta[i].num ; coutmid endl; } cout平均移动道数(double)sum/11endl; } void SSTF(int mid,struct jop a[]) { cout*****SSTF*****endl; int sum=0; int i; for(i=0;i11;i++) { if(a[i].num==mid) { int flag=0; int s=1; int k;// 下标 k=i; couta[k].name ; couta[k].num ; cout0endl; for(s=1;s11;s++) { if(flag=1) { if(abs(mid-a[k-1].num)=abs(mid-a[k+s].num)) { sum=sum+abs(a[k+s].num-mid); couta[k+s].name ; couta[k+s].num ; coutabs(mid-a[k+s].num)endl; mid=a[k+s].num; flag=1; k=k+s; } if(abs(mid-a[k-1].num)abs(mid-a[k+s].num)) { sum=sum+abs(a[k-1].num-mid); couta[k-1].name ; couta[k-1].num ; coutabs(mid-a[k-1].num)endl; mid=a[k-1].num; flag=0; k=k-1; } } if(flag=0) { if(abs(mid-a[k-s].num)=abs(mid-a[k+1].num)) { sum=sum+abs(a[k+1].num-mid); couta[k+1].name ; couta[k+1].num ; coutabs(mid-a[k+1].num)endl; mid=a[k+1].num; flag=1; k=k+1; } if(abs(mid-a[k-s].num)abs(mid-a[k+1].num)) { sum=sum+abs(a[k-s].num-mid); couta[k-s].name ; couta[k-s].num ; coutabs(mid-a[k-s].num)endl; mid=a[k-s].num; flag=0; k=k-s; } } if(k=0||k=11)break; } if(k=1) { for(k=k+s+1;k11;k++) { sum=sum+abs(a[k].num-mid); couta[k].name ; couta[k].num ; coutabs(a[k].num-mid)endl; mid=a[k].num; } } break; } } cout平均移动道数(double)sum/11endl; } void