數(shù)據(jù)結(jié)構(gòu)-實(shí)驗(yàn)隊(duì)列的實(shí)現(xiàn)

1、貴州大學(xué)實(shí)驗(yàn)報(bào)告學(xué)院： 計(jì)信學(xué)院 專(zhuān)業(yè)： 網(wǎng)絡(luò)工程 班級(jí)：091班姓名XXX學(xué)號(hào)XXXXXXXXX實(shí)驗(yàn)組5實(shí)驗(yàn)時(shí)間2011.12.02指導(dǎo)教師XXXXX成績(jī)實(shí)驗(yàn)項(xiàng)目名稱隊(duì)列的實(shí)現(xiàn) 實(shí)驗(yàn)?zāi)康?掌握隊(duì)列的思想及其存儲(chǔ)實(shí)現(xiàn)。 2掌握隊(duì)列的常見(jiàn)算法的程序?qū)崿F(xiàn)。實(shí)驗(yàn)原理1. 根據(jù)實(shí)驗(yàn)內(nèi)容編程，上機(jī)調(diào)試、得出正確的運(yùn)行程序。2. 編譯運(yùn)行程序，觀察運(yùn)行情況和輸出結(jié)果。3. 寫(xiě)出實(shí)驗(yàn)報(bào)告（包括源程序和運(yùn)行結(jié)果）。實(shí)驗(yàn)內(nèi)容1采用鏈?zhǔn)酱鎯?chǔ)實(shí)現(xiàn)隊(duì)列的初始化、入隊(duì)、出隊(duì)操作。 2采用順序存儲(chǔ)實(shí)現(xiàn)循環(huán)隊(duì)列的初始化、入隊(duì)、出隊(duì)操作。 3在主函數(shù)中設(shè)計(jì)一個(gè)簡(jiǎn)單的菜單，分別測(cè)試上述算法。實(shí)驗(yàn)數(shù)據(jù)及其步驟鏈?zhǔn)酱鎯?chǔ)隊(duì)列：#in

2、clude#includeusing namespace std;typedef int ElemType;struct QueueElemType *queue;int front,rear,len;int Maxsize;void Initqueue(Queue &Q) cout隊(duì)列初始化操作endl;Q.Maxsize=10;Q.queue=new ElemTypeQ.Maxsize;Q.front=Q.rear=0;void Enqueue(Queue &Q,ElemType item)if(Q.rear+1)%Q.Maxsize=Q.front)int k=sizeof(ElemTy

3、pe);Q.queue=(ElemType*)realloc(Q.queue,2*Q.Maxsize*k);if(Q.rear!=Q.Maxsize-1)for(int i=0;i=Q.rear;i+)Q.queuei+Q.Maxsize=Q.queuei;Q.rear+=Q.Maxsize;Q.Maxsize=2*Q.Maxsize;Q.rear=(Q.rear+1)%Q.Maxsize;Q.queueQ.rear=item;ElemType Outqueue(Queue &Q)if(Q.front=Q.rear)cout隊(duì)列已空,無(wú)法刪除!endl;exit(1);Q.front=(Q.f

4、ront+1)%Q.Maxsize;return Q.queueQ.front;struct LNodeElemType data;LNode *next;struct LinkQueueLNode *front;LNode *rear;void init(LinkQueue &HQ) cout鏈?zhǔn)疥?duì)列初始化data=item;newptr-next=NULL;if(HQ.rear=NULL)HQ.front=HQ.rear=newptr;else HQ.rear=HQ.rear-next=newptr;ElemType outq(LinkQueue &HQ)if(HQ.front=NULL)

5、cout鏈隊(duì)為空,無(wú)法刪除data;LNode *p=HQ.front;HQ.front=p-next;if(HQ.front=NULL)HQ.rear=NULL;delete p;return temp;void main()ElemType x,y;int i;int a4=1,3,5,7;cout原始數(shù)組數(shù)據(jù)endl;for(i=0;i4;i+)coutai ;coutendl;Queue q1; cout操作一endl;Initqueue(q1);for(i=0;i4;i+)Enqueue(q1,ai);cout輸入要進(jìn)隊(duì)列的元素:x; Enqueue(q1,x); cout出隊(duì)操作e

6、ndl; for(i=0;i5;i+) coutOutqueue(q1) ; coutendl; LinkQueue q2; cout操作二endl; init(q2); for(i=0;i4;i+) enq(q2,ai); cout輸入要進(jìn)鏈隊(duì)列的元素y; enq(q2,y); cout出鏈隊(duì)操作endl; for(i=0;i5;i+) coutoutq(q2) ; coutendl;運(yùn)行結(jié)果如下：順序存儲(chǔ)隊(duì)列：#include#include#define OVERFLOW -1#define OK 1#define ERROR 0#define MAXSIZE 100typedef st

7、ructint *elem;/隊(duì)列存儲(chǔ)空間int front;int rear;SqQueue;/判斷選擇是否正確int menu_select()int sn;for(;)scanf(%d,&sn);if(sn6)printf(nt輸入錯(cuò)誤，請(qǐng)重新輸入n);elsebreak;return sn;int InitQueue(SqQueue &Q)Q.elem=(int *)malloc(MAXSIZE*sizeof(int);if(!Q.elem)exit(OVERFLOW);Q.front=Q.rear=-1;for(int i=0;iMAXSIZE;i+)Q.elemi=-1;retur

8、n OK;int QueueLength(SqQueue Q)return (Q.rear-Q.front+MAXSIZE)%MAXSIZE;void Display(SqQueue Q)for(int i=0;i=QueueLength(Q);i+)if(Q.elemi!=-1)printf(%d ,Q.elemi);printf(n);int EnQueue(SqQueue &Q,int e)Q.rear=(Q.rear+1)%MAXSIZE;if(Q.rear=Q.front)return ERROR;Q.elemQ.rear=e;return OK;int DeQueue(SqQueu

9、e &Q,int &e)if(Q.front=Q.rear)return ERROR;e=Q.elemQ.front+1;Q.elemQ.front+1=-1;Q.front=(Q.front+1)%MAXSIZE;return OK;void main()SqQueue Q;InitQueue(Q);int elem,e;printf(請(qǐng)輸入隊(duì)列元素(以0結(jié)束):n);scanf(%d,&elem);while(elem!=0)EnQueue(Q,elem);scanf(%d,&elem);printf(隊(duì)列為：n);Display(Q);printf(1.初始化一個(gè)隊(duì)列;n2.入隊(duì);n3.

10、出隊(duì);n4.顯示隊(duì)列的所有元素;n5.隊(duì)列長(zhǎng)度:n6.結(jié)束;n);while(1)switch(menu_select()case 1:printf(請(qǐng)輸入隊(duì)列元素(以0結(jié)束):n);scanf(%d,&elem); while(elem!=0)EnQueue(Q,elem); scanf(%d,&elem);printf(隊(duì)列為：n);Display(Q);fflush(stdin);break; case 2:scanf(%d,&elem);EnQueue(Q,elem);printf(隊(duì)列為：n);Display(Q);fflush(stdin);break;case 3:DeQueue(Q,elem);printf(隊(duì)列為：n);Display(Q);break;