优先级算法(用最大值堆实现).docVIP

#includestdio.h //实现进程的优先级调度算法(较为复杂）这是数值高的为优先级高的先输出 #includestdlib.h #includeiostream.h #define MAXSIZE 100 typedef struct { int id; //进程ID int key; //进程的优先级 }xinxiType; typedef struct//这是定义一组数组进程 { xinxiType r[MAXSIZE]; int length; //定义进程数 }Sqlist; typedef Sqlist HeapType; void Intial(HeapType *H)//初始化进程 { int i; for(i=0;i=MAXSIZE;i++) { H-r[i].id=0; H-r[i].key=0; H-length=0; } } void CreatHeap(HeapType *H,int a,int b) //新建一个数组元素 { H-r[H-length].id=a; H-r[H-length].key=b; H-length++; } void MakeHeap(HeapType *H) //插入一个新元素时保证堆为最大值堆 { int n=H-length-1; while((H-length!=0)(n!=0)(H-r[n].keyH-r[(n-1)/2].key)) { int x=H-r[n].id; int y=H-r[n].key; H-r[n]=H-r[(n-1)/2]; H-r[(n-1)/2].id=x; H-r[(n-1)/2].key=y; n=(n-1)/2; } } void RemoveMax(HeapType *H) //移出最大值后使堆仍为最大值堆 { cout进程的ID值：H-r[0].id 进程的优先级H-r[0].keyendl; H-r[0]=H-r[H-length-1]; H-r[H-length-1].id=0;H-r[H-length-1].key=0; H-length--; int i=0; while((H-r[i].keyH-r[2*i+1].key)||(H-r[i].keyH-r[2*i+2].key)) { if(H-r[2*i+1].keyH-r[2*i+2].key) {int x=H-r[i].id; int y=H-r[i].key; H-r[i].id=H-r[2*i+1].id; H-r[i].key=H-r[2*i+1].key; H-r[2*i+1].id=x; H-r[2*i+1].key=y; } else { int x=H-r[i].id; int y=H-r[i].key; H-r[i].id=H-r[2*i+2].id; H-r[i].key=H-r[2*i+2].key; H-r[2*i+2].id=x; H-r[2*i+2].key=y; } } } void main() { int x=0,y=0; HeapType *H; H=(HeapType *)malloc(sizeof(HeapType)); Intial(H); cout请输入进程的ID和priority值: endl; while(x!=-1y!=-1) { cinxy; coutendl; if(x==-1) break; CreatHeap(H,x,y); //新建一个堆数组元素时 MakeHeap(H); //相当于插入一个元素使堆为最大值堆 } cout算法调度顺序如下:endl; while(H-length!=0) RemoveMax(H); }