【正文】 return 0。 =(+1)%QueueSize。[]=x。return 1。}status DeQueue(SqQueue amp。qu,char amp。x){ if(==)return 0。 =( +1)%QueueSize。x=[]。return 1。}status GetHead(SqQueue qu,char amp。x){ if( ==)return 0。x=[(+1)%QueueSize]。return 1。}status QueueEmpty(SqQueue qu){ if(==)return 1。elsereturn 0。}void main(){ SqQueue qu。char e。InitQueue(qu)。printf(“Queue %sn”,(QueueEmpty(qu)==1?“Empty”:“Not Empty”))。printf(“inser an”)。EnQueue(qu,39。a39。)。printf(“inser bn”)。EnQueue(qu,39。b39。)。printf(“inser ”)。EnQueue(qu,39。c39。)。printf(“inser dn”)。EnQueue(qu,39。d39。)。printf(“Queue %sn”,(QueueEmpty(qu)==1?“Empty”:“Not Empty”))。GetHead(qu,e)。printf(“Queue of top elem is: %”,e)。printf(“show of Queue:n”)。while(!QueueEmpty(qu)){DeQueue(qu,e)。printf(“%ct”,e)。}printf(“n”)。} 實(shí)驗(yàn)結(jié)果：（2）//用棧實(shí)現(xiàn)對(duì)表達(dá)式的求值運(yùn)算include include include define TRUE 1 define FALSE 0 define OK define ERROR 0 define INFEASIBLE1 define OVERFLOW2 define STACK_INIT_SIZEdefine STACKINCREMENT 10typedef int Status。typedef char ElemType。typedef ElemType OperandType。typedef char OperatorType。typedef struct {ElemType *base。ElemType *top。int stacksize。}SqStack。Status InitStack(SqStack amp。S){ =(ElemType *)malloc(STACK_INIT_SIZE * sizeof(ElemType))。if(!)exit(OVERFLOW)。 = 。 = STACK_INIT_SIZE。return OK。}Status GetTop(SqStack S){ElemType e。if( == )return ERROR。e = *()。return e。}Status Push(SqStack amp。S,ElemType e){if( n){merge(r, r1, i, i+length1, i + 2*length1 n1)merge(r, r1, i, i+length1, n1)。elsefor(j = i。j n。j++)r1[j] = r[j]。}void MergeSort(SortObject * pvector){RecordNode record[MAXNUM]。int length = 1。while(length pvectorn){mergePass(pvectorrecord, record, pvectorn, length)。length *= 2。mergePass(record, pvectorrecord, pvectorn, length)。length *= 2。} }SortObject vector = {8, 49,38,65,97,76,13,27,49}。int main(){int i。printf(“排序前序列為：”)。for(i = 0。i 8。i++)printf(“%d ”, [i])。printf(“n”)。MergeSort(amp。vector)。printf(“采用歸并排序?yàn)椋骸?。for(i = 0。i 8。i++)printf(“%d ”, [i])。getchar()。return 0。}實(shí)驗(yàn)結(jié)果：實(shí)驗(yàn)十查找實(shí)驗(yàn)(2學(xué)時(shí))* 實(shí)驗(yàn)?zāi)康模?1)熟練掌握各種靜態(tài)查找表方法(順序查找、折半查找、索引順序表等)；(2)熟練掌握二叉排序樹的構(gòu)造方法和查找算法；(3)了解和掌握其它查找方法。實(shí)驗(yàn)內(nèi)容：(類C算法的程序?qū)崿F(xiàn)，除順序查找算法之外，任選一個(gè))(1)順序查找算法的實(shí)現(xiàn)(必做)；(2)折半查找算法的實(shí)現(xiàn)(選做)； 實(shí)驗(yàn)結(jié)果：//查找實(shí)驗(yàn)順序查找：include define LENGTH 20void SequenceSearch(int *fp,int Length){int data。printf(“: ”)。scanf(“%d”,amp。data)。for(int i=0。iif(fp[i]==data){printf(“數(shù)據(jù)%d 是第 %d 個(gè)數(shù)據(jù)n”,data,i+1)。return。}printf(“未能查找到數(shù)據(jù)%”,i,data)。}void main(){int count。int arr[LENGTH]。printf(“請(qǐng)輸入你的數(shù)據(jù)的個(gè)數(shù):”)。scanf(“%d”,amp。count)。printf(“請(qǐng)輸入 %d 個(gè)數(shù)據(jù):”,count)。for(int i=0。iscanf(“%d”,amp。arr[i])。SequenceSearch(arr,count)。}實(shí)驗(yàn)結(jié)果：折半查找：include include define M 10typedef struct { char *elem。int length。}SStable。void Create(char **t){ int i。static char a[M+1]。*t=a。for(i=1。iprintf(“A[%d] is:”,i)。scanf(“%c”,amp。a[i])。if(a[i]!= 39。n39。)getchar()。} }int Searth(char *t,char k){ int i。for(i=M。i=0 amp。amp。 t[i]!=k。i)。Return i。}void output(char *t){ int i。for(i=1。iprintf(“nA[%d] is %c”,i,t[i])。}void px(char *t){ char s。int i,j。for(i=1。ifor(j=i+1。j{if(t[i]t[j]){s=t[i]。t[i]=t[j]。t[j]=s。}} }int Search_bin(char *t,char k){ int low=1,high=M,mid。while(lowmid=(low+high)/2。if(k==t[mid])return mid。else if(kelse low=mid+1。} return 0。}void main(){ char *t,k。int s。Create(amp。t)。output(t)。printf(“nplease input you search char:”)。k=getchar()。s=Searth(t,k)。if(s=0)printf(“1: use search find is A[%d]n”,s)。else printf(“1:can not find itn”)。px(t)。output(t)。s=Search_bin(t,k)。if(s==0)printf(“n1:can not find it n”)。else printf(“n2:use Search_bin find is A[%d]n”,s)。getchar()。}實(shí)驗(yàn)結(jié)果：