时间片轮转算法(C++版).doc

#include #include #include constintQueueNum=10; constintQueuePre=-1; constintERROR=0; constintOK=1; constintTimePiece=1; typedefintElemType; /headdefine. /*/ classQueue_c ElemTypeQQueueNum; intfront,rear; public: /basicinformationoftheclassQueue_c: Queue_c(); intqFull(); intqEmpty(); intqEnQueue(ElemTypee); ElemTypeqDeQueue(); intqGetNumber(); intqGetElem(int); intqShowQueue(); /otherfunctions: ElemTypeqGetFrontElem()if(qEmpty()coutERROR!endl;returnERROR;returnQfront; /intqGetFront()if(qEmpty()coutERROR!endl;returnERROR;returnfront; /ElemTypeqGetRearElem()if(qEmpty()coutERROR!endl;returnERROR;returnQ(rear-1+QueueNum)%QueueNum; /intqGetRear()if(qEmpty()coutERROR!endl;returnERROR;return(rear-1+QueueNum)%QueueNum; /intqShowAll(); intqDec() if(qEmpty()coutERROR!endl;returnERROR;/endif Qfront-=TimePiece; returnOK; /intqXChange(int); ; /=DefineofClassQueue_c= /= classWork_c Queue_cbuf; public: intwCPU(); /ElemTypewScan(int&t); intwMakeP(); intwShowBUF()returnbuf.qShowQueue(); intwInBUF(inti)returnbuf.qEnQueue(i); ; /=DefineofClassWork_c= /= /*=main=* *=proc=*/ voidmain() Work_cw; inti; /w.wInBUF(5); /w.wInBUF(3); /w.wInBUF(1); clrscr(); charflag=y; for(i=0;i10;i+) /w.buf.qShowQueue(); w.wMakeP(); w.wCPU(); w.wShowBUF(); if(9=i) coutAreyouwanttocontinue?y/nflag; if(n=flag)break;elsei=0; clrscr(); /endif /endfor /*=END=* *=main=*/ /*ClassQueue_c*/ /=Queue_c= Queue_c:Queue_c() inti; for(i=0;iQueueNum;i+)Qi=QueuePre; rear=0; front=0; /=qFull= intQueue_c:qFull() if(rear+1)%QueueNum=front) /coutQueueisfullendl; returnOK; elsereturnERROR; /=qEmpty= intQueue_c:qEmpty() if(rear=front) /coutQueueisEmptyendl; returnOK; /endif elsereturnERROR; /=qEnQueue=intQueue_c:qEnQueue(ElemTypee) if(qFull()returnERROR; Qrear=e; rear=(rear+1)%QueueNum; returnOK; /=qDeQueue= ElemTypeQueue_c:qDeQueue() ElemTypee; if(qEmpty()returnERROR; e=Qfront; Qfront=QueuePre; front=(front+1)%QueueNum; returne; /=qGetNumber= intQueue_c:qGetNumber() inti; i=(rear-front+QueueNum)%QueueNum); returni; /=qGetElem= ElemTypeQueue_c:qGetElem(inti) if(qEmpty()coutERROR!qGetNumber()-1) coutERROR!thereisnoi,ornoiinQueuenowendl; returnERROR; returnQ(front+i)%QueueNum; /=qShowQueue= intQueue_c:qShowQueue() inti; if(qEmpty()returnERROR; for(i=front;i!=rear%QueueNum;i=(i+1)%QueueNum) coutQi; /endfor coutendl; returnOK; /=qShowAll= /*intQueue_c:qShowAll() inti; for(i=0;iQueueNum;i+)coutQi; coutendl; returnOK; */ /*intQueue_c:qXChange(inti) ElemTypet; if(1=qGetNumber()returnOK; if(qEmpty()coutERROR!qGetNumber()-1) coutERROR!thereisnoi,ornoiinQueuenow0)buf.qEnQueue(temp); returnOK; /=wScan= /ElemTypeWork_c:wScan(int&t) / /inti,m=12; /ElemTypetemp; /for(i=0;ibuf.qGetNumber();i+) / /temp=buf.qGetElem(i); /if(tempm)m=temp;t=i;/endif /endfor /if(mbuf.qGetFrontElem()returnERROR;/如果是负数的话在这里就被拦下来了,所以,传出出去的m不可能