insert(run);
firstin();
}
prt(alg);
}
}
void main()
{
char algo='p';
cout<<"输入进程的个数:";
cin>>N;
create(algo);
priority(algo);
}
时间片轮转调度算法(C++代码)
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <iostream.h>
typedef struct node
{
char name[10];
int prio;
int round;
int cputime;
int needtime;
int count;
char state;
struct node *next;
}PCB;
PCB *finish,*ready,*tail,*run; //队列指针
int N; //进程数
void firstin()
{
run=ready; //就绪队列头指针赋值给运行头指针