多级队列调度算法可视化界面_模拟多级反馈队列调度算法原理（源程序c++)

#include "stdio.h"

#include

#include

#define getpch(type) (type*)malloc(sizeof(type))

#define NULL 0

int time[3];

struct program {

char name[10];

char state;

int queue;//进程队列

int

priority; // 数字越小优先级越高

int needtime;//需运行时间

int runtime; //已经运行时间

struct program *link;

}*ready=NULL;

typedef struct program PROGRAM;

PROGRAM

*run=NULL,*head1=NULL,*head2=NULL,*head3=NULL,*end1=NULL,*end2=NULL,*end3=NULL;

void sort(PROGRAM *p)

{switch(p->queue)

{case 1:

{if(head1==NULL) {head1=p;end1=p;}

else

{end1->link=p;end1=p;p->link=NULL;}

p->state='w';

break;

}

case 2:

{if(head2==NULL)

{head2=