本文格式為Word版，下載可任意編輯——數(shù)據(jù)結(jié)構(gòu)課程設(shè)計(jì)題目數(shù)據(jù)結(jié)構(gòu)與算法課程設(shè)計(jì)報(bào)告(五篇)在當(dāng)下社會(huì)，接觸并使用報(bào)告的人越來(lái)越多，不同的報(bào)告內(nèi)容同樣也是不同的。報(bào)告對(duì)于我們的幫助很大，所以我們要好好寫一篇報(bào)告。下面是我為大家整理的報(bào)告范文，僅供參考，大家一起來(lái)看看吧。

#includeexpn)//查找插入位置expn)return-1;</b-elsereturn0;

}

elseif(!ab)return-1;//a多項(xiàng)式已空，但b多項(xiàng)式非空

elsereturn1;//b多項(xiàng)式已空，但a多項(xiàng)式非空}//求解并建立多項(xiàng)式a+b，返回其頭指針polynadd(polynpa,polynpb){

polynqa=pa-next;

polynqb=pb-next;

polynheadc,hc,qc;

hc=(polyn)malloc(sizeof(structpolynomial));//建立頭結(jié)點(diǎn)11

hc-next=null;

headc=hc;

while(qa||qb){

qc=(polyn)malloc(sizeof(structpolynomial));

switch(compare(qa,qb))

{

case1:

qc-coef=qa-coef;

qc-expn=qa-expn;

qa=qa-next;

break;

case0:

qc-coef=qa-coef+qb-coef;

qc-expn=qa-expn;

qa=qa-next;

qb=qb-next;

break;

case-1:

qc-coef=qb-coef;

qc-expn=qb-expn;

qb=qb-next;

break;12

}

if(qc-coef!=0)

{

qc-next=hc-next;

hc-next=qc;

hc=qc;

}

elsefree(qc);//當(dāng)相加系數(shù)為0時(shí)，釋放該結(jié)點(diǎn)

}

returnheadc;}//求解并建立多項(xiàng)式a-b，返回其頭指針polynsubtract(polynpa,polynpb){

polynh=pb;

polynp=pb-next;

polynpd;

while(p)//將pb的系數(shù)取反

{p-coef*=-1;p=p-next;}

pd=add(pa,h);

for(p=h-next;p;p=p-next)

//恢復(fù)pb的系數(shù)

p-coef*=-1;13

returnpd;}//求解并建立多項(xiàng)式a*b，返回其頭指針polynmultiply(polynpa,polynpb){

polynhf,pf;

polynqa=pa-next;

polynqb=pb-next;

hf=(polyn)malloc(sizeof(structpolynomial));//建立頭結(jié)點(diǎn)

hf-next=null;

for(;qa;qa=qa-next)

{

for(qb=pb-next;qb;qb=qb-next)

{

pf=(polyn)malloc(sizeof(structpolynomial));

pf-coef=qa-coef*qb-coef;

pf-expn=qa-expn+qb-expn;

insert(pf,hf);//調(diào)用insert函數(shù)以合并指數(shù)一致的項(xiàng)

}

}

returnhf;}

//求解并建立多項(xiàng)式a/b，返回其頭指針voiddevice(polynpa,polynpb){

polynhf,pf,temp1,temp2;

polynqa=pa-next;

polynqb=pb-next;

hf=(polyn)malloc(sizeof(structpolynomial));//建立頭結(jié)點(diǎn),存儲(chǔ)商

hf-next=null;

pf=(polyn)malloc(sizeof(structpolynomial));//建立頭結(jié)點(diǎn)，存儲(chǔ)余數(shù)

pf-next=null;

temp1=(polyn)malloc(sizeof(structpolynomial));

temp1-next=null;

temp2=(polyn)malloc(sizeof(structpolynomial));

temp2-next=null;

temp1=add(temp1,pa);

while(qa!=nullqa-expn=qb-expn)

{

temp2-next=(polyn)malloc(sizeof(structpolynomial));

temp2-next-coef=(qa-coef)/(qb-coef);

temp2-next-expn=(qa-expn)-(qb-expn);

insert(temp2-next,hf);

pa=subtract(pa,multiply(pb,temp2));15

qa=pa-next;

temp2-next=null;

}

pf=subtract(temp1,multiply(hf,pb));

pb=temp1;

printf(“商是:〞);

print(hf);

printf(“余數(shù)是:〞);

print(pf);}voidmain(){intchoose=1;intm,n,flag=0;system(“colore0〞);polynpa=0,pb=0,pc,pd,pf;//定義各式的頭指針，pa與pb在使用前付初值nullprintf(“請(qǐng)輸入a(x)的項(xiàng)數(shù):〞);scanf(“%d〞,m);printf(“n〞);pa=create(pa,m);//建立多項(xiàng)式aprintf(“n〞);printf(“請(qǐng)輸入b(x)的項(xiàng)數(shù):〞);16

scanf(“%d〞,n);printf(“n〞);pb=create(pb,n);//建立多項(xiàng)式bprintf(“n〞);printf(“**********************************************n〞);printf(“*

多項(xiàng)式操作菜單

printf(〞**********************************************n“);printf(〞tt1.輸出操作n“);printf(〞tt2.加法操作n“);printf(〞tt3.減法操作n“);printf(〞tt4.乘法操作n“);printf(〞tt5.除法操作n“);printf(〞tt6.退出操作n“);printf(〞**********************************************n“);while(choose){

printf(〞執(zhí)行操作:“);

scanf(〞%d“,flag);

switch(flag)

{

case1:

printf(〞多項(xiàng)式a(x):“);print(pa);*n〞);

printf(“多項(xiàng)式b(x):〞);print(pb);

break;

case2:

pc=add(pa,pb);

printf(“多項(xiàng)式a(x)+b(x):〞);print(pc);

destroy(pc);break;

case3:

pd=subtract(pa,pb);

printf(“多項(xiàng)式a(x)-b(x):〞);print(pd);

destroy(pd);break;

case4:

pf=multiply(pa,pb);

printf(“多項(xiàng)式a(x)*b(x):〞);

print(pf);

destroy(pf);

break;