順序隊(duì)的基本操作

1、精選優(yōu)質(zhì)文檔-傾情為你奉上上機(jī)實(shí)驗(yàn)報(bào)告學(xué) 院： 計(jì)算機(jī)與信息技術(shù)學(xué)院專(zhuān) 業(yè)： 計(jì)算機(jī)科學(xué)與技術(shù)(師范）課程名稱(chēng)： 數(shù)據(jù)結(jié)構(gòu)實(shí)驗(yàn)題目： 順序隊(duì)的基本操作班級(jí)序號(hào)： 師范1班學(xué) 號(hào)： 1 學(xué)生姓名： 鄧雪指導(dǎo)教師： 楊紅穎完成時(shí)間： 2015年12月25號(hào)1、 實(shí)驗(yàn)?zāi)康模?1熟悉掌握隊(duì)的定義、結(jié)構(gòu)及性質(zhì)； 2. 熟練掌握循環(huán)隊(duì)列的操作及應(yīng)用,掌握循環(huán)隊(duì)列的入隊(duì)和出隊(duì)等基本操作。  3. 加深對(duì)隊(duì)列結(jié)構(gòu)的理解，逐步培養(yǎng)解決實(shí)際問(wèn)題的編程能力二、實(shí)驗(yàn)環(huán)境： Windows 8.1 Microsoft Visual c+ 6.0三、 實(shí)驗(yàn)內(nèi)容及要求：掌握隊(duì)列的概念及性質(zhì)，并建立順序隊(duì)

2、，實(shí)現(xiàn)如下功能：1.建立一個(gè)順序隊(duì)2.輸出隊(duì)3.求隊(duì)長(zhǎng)4.判隊(duì)空5.取隊(duì)頭6.入隊(duì)7.出隊(duì)8. 清空棧四、概要設(shè)計(jì)：1、通過(guò)循環(huán)，由鍵盤(pán)輸入一串?dāng)?shù)據(jù)。創(chuàng)建并初始化一個(gè)順序隊(duì)。 2、編寫(xiě)實(shí)現(xiàn)相關(guān)功能函數(shù)，完成子函數(shù)模塊如下。 3、 調(diào)用子函數(shù)，實(shí)現(xiàn)菜單調(diào)用功能，完成順序表的相關(guān)操作。main建隊(duì)求隊(duì)長(zhǎng)出隊(duì)取隊(duì)頂入隊(duì)清空隊(duì)判隊(duì)空五、代碼#include <stdio.h> #include <stdlib.h> #define maxsize 1024typedef int datatype;/定義結(jié)構(gòu)體typedef struct datatype datamaxsize

3、;int front,rear;sequeue;sequeue *sq;/建立順序隊(duì)sequeue *SET()sequeue *sq;datatype x;sq=(sequeue *)malloc(sizeof(sequeue); sq->front=maxsize-1;sq->rear=maxsize-1;printf("請(qǐng)輸入要存入的結(jié)點(diǎn)值(以0結(jié)尾)n");scanf("%d",&x);while(x!=0) sq->rear=(sq->rear+1)%maxsize;sq->datasq->rear=

4、x;scanf("%d",&x);printf("順序隊(duì)輸入成功nn");return sq; /判隊(duì)空int EMPTY(sequeue *sq)if(sq->rear=sq->front)return 1; else return 0;/輸出void PRINT(sequeue *sq)int i;if(EMPTY(sq)printf("sequeue is emptyn"); elsei=(sq->front+1)%maxsize; while(i<=sq->rear) printf(&qu

5、ot;%d ",sq->datai); i=(i+1)%maxsize;/隊(duì)長(zhǎng)度int LENGTH(sequeue *sq) int count=0,i;if(EMPTY(sq)return count; else i=(sq->front+1)%maxsize;while(i<=sq->rear)count+; i=(i+1)%maxsize; return count;/ 取隊(duì)頭datatype FRONT(sequeue *sq) datatype x;if(EMPTY(sq) printf("sequeue is emptyn")

6、; return NULL; elsex=sq->data(sq->front+1)%maxsize; return x;/入隊(duì)void ENQUEUE(sequeue *sq) datatype x; printf("請(qǐng)輸入要插入的結(jié)點(diǎn)值n"); scanf("%d",&x);if(sq->front=(sq->rear+1)%maxsize) printf("sequeue is fulln"); exit(0); else sq->rear=(sq->rear+1)%maxsize;

7、sq->datasq->rear=x; printf("插入成功n"); /出隊(duì)datatype DEQUEUE(sequeue *sq) if(EMPTY(sq) printf("sequeue is emptyn");return NULL; else sq->front=(sq->front+1)%maxsize; return (sq->datasq->front); /置空隊(duì)void SETNULL(sequeue *sq) sq->front=maxsize-1; sq->rear=maxsiz

8、e-1;/主函數(shù)void main() sequeue; int a,p;printf("nn"); printf("1、建立隊(duì)n"); printf("2、輸出隊(duì) n"); printf("3、隊(duì)長(zhǎng)度n"); printf("4、判隊(duì)空n"); printf("5、取隊(duì)頭n"); printf("6、入隊(duì)n"); printf("7、出隊(duì)n"); printf("8、清空隊(duì)n"); printf("9、退

9、出程序n"); printf("nnn"); do printf("按需求選擇功能: "); scanf("%d",&a); switch(a) case 1: sq=SET(); break; case 2: printf("該隊(duì)列內(nèi)容為:nn"); PRINT(sq); break;case 3: printf("隊(duì)長(zhǎng)度為:%dnn",LENGTH(sq);break; case 4: if(EMPTY(sq)printf("sequeue is emptyn&q

10、uot;); elseprintf("sequeue is not emptyn");break; case 5: p=FRONT(sq); printf("隊(duì)頭元素為:%dn",p);break; case 6: ENQUEUE(sq); printf("插入新元素后的隊(duì)為:nn");PRINT(sq);break; case 7: printf("出隊(duì)操作前隊(duì)頭元素為:%dn",DEQUEUE(sq); printf("出隊(duì)后隊(duì)列內(nèi)容為:n");PRINT(sq);break;case 8: SETNULL(sq); if(EMPTY(sq)printf("順序隊(duì)已清空:"); PRINT(sq);break; case 9: printf("感謝使用n");exit(0); default: printf("input errorn"); while(1); 六、運(yùn)行界面 菜單功能七、實(shí)驗(yàn)中遇到的問(wèn)題及總結(jié)主函數(shù)中變量的類(lèi)型和子函數(shù)中類(lèi)型不匹配，通