非抢占按优先数调度算法源代码

非抢占按优先数调度算法源代码 #include <stdio.h> #include <stdlib.h> #define MAX 5 //进程数 /*非抢占式优先数算法*/ struct pro1 { int num; //进程名 int arriveTime; //到达时间 int burst; //运行时间; int weight; //优先数 struct pro1 *next; }; //函数声明 struct pro1* creatList(); void insert(struct pro1 *head,struct pro1 *s); struct pro1* searchByAT(struct pro1 *head,int AT); void run(struct pro1 *head); void del(struct pro1* p); int getCount(struct pro1 *head,int time); struct pro1* creatList() //创建链表，按照进程的到达时间排列 { struct pro1* head=(struct pro1*)malloc(sizeof(struct pro1)); head->next=NULL; struct pro1 *s; int i; for(i=0;i<MAX;i++) { s=(struct pro1*)malloc(sizeof(struct pro1)); printf("请输入进程名:\n"); scanf("%d",&(s->num)); printf("请输入到达时间:\n"); scanf("%d",&(s->arriveTime)); printf("请输入运行时间:\n"); scanf("%d",&(s->burst)); printf("请输入优先数:\n"); scanf("%d",&(s->weight)); s->next=NULL; insert(head,s); } return head; } void insert(struct pro1 *head,struct pro1 *s) //插入节点 { struct pro1 *p=searchByAT(head,s->arriveTime); s->next=p->next; p->next=s; return; } struct pro1* searchByAT(struct pro1 *head,int AT) //查找第一个到达时间大于等于AT的节点，返回其前一个指针