//高响应比调度算法
#include<stdio.h>
#include<stdlib.h>
struct zgxyb{
char name[10];
float arrivetime;
float servicetime;
float starttime;
float finishtime;
float zztime;
float dqzztime;
};
struct zgxyb a[100];
void input(struct zgxyb *p,int N)
{ int i;
printf("intput the process's name & arrivetime & servicetime:for exmple: a 0 100");
for(i=0;i<=N-1;i++)
{
printf("input the %dth process's information:",i+1);
scanf("%s%f%f",&p[i].name,&p[i].arrivetime,&p[i].servicetime);
}
}
void Print(struct zgxyb *p,float arrivetime,float servicetime,float starttime,float finishtime,float
zztime,float dqzztime,int N)
{int k;
5555 printf("run order:");
5555 printf("%s",p[0].name);
for(k=1;k<N;k++)
{printf("-->%s",p[k].name);
}
555 printf("the process's information:");
55 printf("name arrive service start finish zz dqzz");
5555 for(k=0;k<=N-1;k++)
5555 { printf("%s %-.2f %-.2f %-.2f %-.2f %-.2f %-.2f \
n",p[k].name,p[k].arrivetime,p[k].servicetime,p[k].starttime,p[k].finishtime,p[k].zztime,p[k].dqzzt
ime);
}
55
}
//按到达时间排序
void sort(struct zgxyb *p,int N)
{
5int i,j;
5555 for(i=0;i<=N-1;i++)