隊(duì)列實(shí)驗(yàn)報(bào)告

一．實(shí)驗(yàn)項(xiàng)目名稱循環(huán)隊(duì)列和鏈?zhǔn)疥?duì)列的創(chuàng)建二、實(shí)驗(yàn)?zāi)康?、掌握?duì)列的特點(diǎn)(先進(jìn)先出FIFO)及基本操作如入隊(duì)、出隊(duì)等，、隊(duì)列順序存儲(chǔ)結(jié)構(gòu)、鏈?zhǔn)酱鎯?chǔ)結(jié)構(gòu)和循環(huán)隊(duì)列的實(shí)現(xiàn)，以便在實(shí)際問(wèn)題背景下靈活應(yīng)用。三、實(shí)驗(yàn)內(nèi)容．鏈?zhǔn)疥?duì)列的實(shí)現(xiàn)和運(yùn)算．循環(huán)隊(duì)列的實(shí)現(xiàn)和運(yùn)算四、主要儀器設(shè)備及耗材VC++6.0運(yùn)行環(huán)境實(shí)現(xiàn)其操作五．程序算法(1)循環(huán)隊(duì)列操作的算法進(jìn)隊(duì)列Voidenqueue(seqqueue&q,elemtypex){if((q.rear+1)%maxsize==q.front)cout<<”overflow”;else{q.rear=(q.rear+1)%maxsize;//編號(hào)加1或循環(huán)回第一個(gè)單元q.queue[q.rear]=x;}}出隊(duì)列Voiddlqueue(seqqueue&q){if(q.rear==q.front)cout<<”underflow”;elseq.front=(q.front+1)%maxsize;}取對(duì)頭元素elemtypegethead(seqqueueq){if(q.rear==q.front){cout<<”w”returnNULL;}elsereturnq.queue[(q.front+1)%maxsize];//front指向隊(duì)頭前一個(gè)位置}判隊(duì)列空否intempty(seqqueueq){if(q.rear==q.front)reurn1;elsereturn0;}（）鏈隊(duì)列操作的算法.鏈隊(duì)列上的初始化voidINIQUEUE(linkqueue&s){link*p;p=newlink;p->next=NULL;//p是結(jié)構(gòu)體指針類型，用->s.front=p;//s是結(jié)構(gòu)體變量，用.s.rear=p;//頭尾指針都指向頭結(jié)點(diǎn)}2>.入隊(duì)列voidpush(linkqueue&s,elemtypex){link*p;//p是結(jié)構(gòu)體指針類型，用->p=newlink;p->data=x;p->next=s.rear->next;//s是結(jié)構(gòu)體變量，用.s.rear->next=p;s.rear=p;//插入最后}判隊(duì)空intempty(linkqueues){if(s.front==s.rear)return1;elsereturn0;}4>.取隊(duì)頭元素elemtypegethead(linkqueues){if(s.front==s.rear)returnNULL;elseretuens.front->next->data;}5>.出隊(duì)列voidpop(linkqueue&s){link*p;p=s.front->next;if(p->next==NULL)//鏈隊(duì)列中只有一個(gè)元素,需要修改rear指針{s.front->next=NULL;s.rear=s.front;}elses.front->next=p->next;//rear不用變delete(p);}六.程序源代碼a.循環(huán)隊(duì)列源代碼#include<iostream.h>#defineMAXN20structseq{charqueue[MAXN];intfront,rear;};voidiniq(seq&q){q.front=q.rear=MAXN-1;}voidenq(seq&q,charx){if((q.rear+1)%MAXN==q.front)cout<<"overflow";else{q.rear=(q.rear+1)%MAXN;q.queue[q.rear]=x;}//return(0);}voiddlq(seq&q){if(q.rear==q.front)cout<<"underflow";elseq.front=(q.front+1)%MAXN;}intgethead(seq&q)//取隊(duì)頭元素{if(q.rear==q.front)//判斷是否隊(duì)列為空cout<<"underflow";elsereturnq.queue[(q.front+1)%MAXN];}main(){seqq;inti,y;iniq(q);cout<<"輸入元素入隊(duì)0為止"<<endl;cin>>i;while(i){enq(q,i);cin>>i;}y=gethead(q);cout<<"隊(duì)頭為="<<y<<endl;dlq(q);y=gethead(q);cout<<"執(zhí)行一次刪除隊(duì)頭后，隊(duì)頭為="<<y<<endl;}b.鏈隊(duì)列的源代碼#include<iostream.h>typedefstructQNode{chardata;QNode*next;}QNode,*QueuePtr;typedefstruct{QueuePtrfront;QueuePtrrear;}LinkQueue;InitQueue(LinkQueue&Q){Q.front=Q.rear=newQNode;Q.front->next=NULL;return0;}EnQueue(LinkQueue&Q,chare){QueuePtrp;p=newQNode;p->data=e;p->next=NULL;Q.rear->next=p;Q.rear=p;return0;}voiddisp(LinkQueue&Q)//打印隊(duì)列{QueuePtrp;p=Q.front->next;while(p!=NULL){cout<<p->data<<"->";p=p->next;}}DeQueue(LinkQueue&Q,char&e){QueuePtrp;if(Q.front==Q.rear)return1;p=Q.front->next;e=p->data;Q.front->next=p->next;if(Q.rear==p)Q.rear=Q.front;deletep;return0;}voidmain(){LinkQueueQ;chare,e1;InitQueue(Q);cout<<"輸入隊(duì)列元素,0時(shí)結(jié)束："<<endl;cin>>e;while(e!='0'){EnQueue(Q,e);cin>>e;}cout<<"隊(duì)列為："<<endl;disp(Q);DeQueue(Q,e1);cout<<endl<<"執(zhí)行一次刪除隊(duì)頭，刪除的元素是:"<<e1<<endl;cout<<"隊(duì)列為:"<<endl;disp(Q);cout<<endl;}六程序輸入數(shù)據(jù)及實(shí)驗(yàn)結(jié)果