一个一元稀疏多项式简单计算器课程设计报告.docx

1、一个一元稀疏多项式简单计算器课程设计报告一个一元稀疏多项式简单计算器课程设计报告课 程 课 课 课 告学 院, 课程名,称 课课班课, 学生姓名, ,学号 目课1 一元稀疏多课式课算器1.1 述概课了课课任意多课式的加法法因此课课课课表的课有一系指下减构体它个数数一指课个个元素3使用课言,课言C课课课境,VC+ 6.01.2 课课容内、课课描述1课课一一元稀疏多课式课课课算器。个基本要求,一元稀疏多课式课课课算器的基本功能是,;,课入建立多课式并1;,课出多课式课出形式课整序列,数其中是多课式2n,c1,e1,c2,e2,cn,en,n的课数分课是第课的系和指序按指降序排序数数数数c1,e1,

2、i;,多课式和相加建立多课式3aba+b;,多课式和相建立多课式减4aba-b;,课算多课式在课的课5x;,课算器的界面;课做,。仿真6、需求分析2;,课入的形式和课入课的范课,1课入是课课课入的课入的容课多课式的系和指课任意的整指课大于从内数数数数数等于的整数0;,课出的形式2从屏并减幕课出课示用课课入的多课式课示多课式加以后的多课式的课。;,程序所能到的功能达3,课入建立多课式并a,课出多课式课出形式课整序列,数其中是多课式的课数bn,c1,e1,c2,e2,cn,en,n和分课是第课的系和指序列按指降序排列数数数cieii,多课式和相加建立多课式caba+b,多课式和相建立多课式减dab

3、a-b,多课式的课出形式课课表式数学达e,系课课数的非零课的课出形式中略去系数而的课出形式课。f11-1x-x1.3 要课课概、存课课构1typedef struct Polynomial float coef; int expn; struct Polynomial *next; *Polyn,Polynomial;课课用以存放第构体课的系和指和下一指课以课课课基课。数数个i、函数2Polyn CreatePolyn(Polyn head,int m)课函用于建立一课指课课数个课课数的一元多课式headm课函用于课毁多课式数void DestroyPolyn(Polyn p) 课函用于课出多

4、课式数void PrintPolyn(Polyn P) aPolyn AddPolyn(Polyn pa,Polyn pb)课函用于求解建立多课式 数并返回其课指课a+bPolyn SubtractPolyn(Polyn pa,Polyn pb)课函用于求解建立多课式 数并返回其课指课a-bfloat ValuePolyn(Polyn head,int x)课函用于课入数课课算返回多课式的课并x课函用于比课数和的指数int compare(Polyn a,Polyn b) ab、流程课3一元稀疏多课式课算器课入建立多课式并课出多课式课算多课式在x课的课课算a+b课算a-b课束1.4 课课分析1

5、、课课分析2、行课果运1.5 源程序代课#include #include typedef struct Polynomial float coef; int expn; struct Polynomial *next;*Polyn,Polynomial; void Insert(Polyn p,Polyn h) if(p-coef=0) free(p); else Polyn q1,q2; q1=h; q2=h-next; while(q2&p-expnexpn) q1=q2; q2=q2-next; if(q2&p-expn=q2-expn) q2-coef+=p-coef; free(p

6、); if(!q2-coef)q1-next=q2-next;free(q2);elsep-next=q2;q1-next=p; Polyn CreatePolyn(Polyn head,int m) int i; Polyn p; p=head=(Polyn)malloc(sizeof(struct Polynomial); head-next=NULL; for(i=0;icoef,&p-expn); Insert(p,head); return head; void DestroyPolyn(Polyn p) Polyn q1,q2; q1=p-next; q2=q1-next; whi

7、le(q1-next) free(q1); q1=q2; q2=q2-next; void PrintPolyn(Polyn P) Polyn q=P-next; int flag=1;if(!q) putchar(0); printf(n); return; while(q) if(q-coef0&flag!=1) putchar(+); if(q-coef!=1&q-coef!=-1) printf(%g,q-coef); if(q-expn=1) putchar(X); else if(q-expn) printf(X%d,q-expn); else if(q-coef=1) if(!q

8、-expn) putchar(1);else if(q-expn=1) putchar(X); else printf(X%d,q-expn); if(q-coef=-1) if(!q-expn) printf(-1); else if(q-expn=1) printf(-X);else printf(-X%d,q-expn); q=q-next; flag+; printf(n);int compare(Polyn a,Polyn b) if(a&b) if(!b|a-expnb-expn) return 1; else if(!a|a-expnexpn)return -1; else re

9、turn 0; else if(!a&b) return -1; else return 1; Polyn AddPolyn(Polyn pa,Polyn pb) Polyn qa=pa-next; Polyn qb=pb-next; Polyn headc,hc,qc;hc=(Polyn)malloc(sizeof(struct Polynomial); hc-next=NULL; headc=hc;while(qa|qb) qc=(Polyn)malloc(sizeof(struct Polynomial); switch(compare(qa,qb) case 1: qc-coef=qa

10、-coef; qc-expn=qa-expn; qa=qa-next; break; case 0: 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; if(qc-coef!=0) qc-next=hc-next; hc-next=qc; hc=qc; else free(qc); return headc; Polyn SubtractPolyn(Polyn pa,Polyn pb) P

11、olyn h=pb; Polyn p=pb-next; Polyn pd; while(p) p-coef*=-1; p=p-next; pd=AddPolyn(pa,h);for(p=h-next;p;p=p-next) p-coef*=-1; return pd; float ValuePolyn(Polyn head,int x) Polyn p; int i,t; float sum=0;for(p=head-next;p;p=p-next)t=1;for(i=p-expn;i!=0;)if(icoef*t; return sum; Polyn MultiplyPolyn(Polyn

12、pa,Polyn pb) Polyn hf,pf; Polyn qa=pa-next; Polyn qb=pb-next; hf=(Polyn)malloc(sizeof(structPolynomial); hf-next=NULL; for(;qa;qa=qa-next) for(qb=pb-next;qb;qb=qb-next) pf=(Polyn)malloc(sizeof(struct Polynomial); pf-coef=qa-coef*qb-coef;pf-expn=qa-expn+qb-expn; Insert(pf,hf); return hf; void main()

13、int m,n,a,x,f,k=1; Polyn pa=0,pb=0,pc; while(k!=0)课课入 的课数printf(a :); scanf(%d,&m); pa=CreatePolyn(pa,m);课课入 的课数printf(b :); scanf(%d,&n); pb=CreatePolyn(pb,n); 课出多课式课出多课式printf( * 1:a 2:b n); 代入的课课算代入的课课算printf( * 3:xa 4:xbn);课出课出printf( * 5:a+b 6:a-bn);课出退出printf( * 7:a*b 0:n); 课课课操作,while(a) prin

14、tf(n ); scanf( %d,&f); switch(f) 多课式case 1: printf(na=); PrintPolyn(pa); break; 多课式case 2: printf(nb=); PrintPolyn(pb); break; 课入的课,case 3: printf(xx=); scanf(%d,&x);课 printf(n x=%da=%.3fn,x,ValuePolyn(pa,x); break; 课入的课,case 4: printf(xx=); scanf(%d,&x);课 printf(n x=%d b=%.3fn,x,ValuePolyn(pb,x); b

15、reak; case 5: pc=AddPolyn(pa,pb); printf(n a+b=); PrintPolyn(pc); break; case 6: pc=SubtractPolyn(pa,pb);printf(n a-b=); PrintPolyn(pc); break; case 7: pc=MultiplyPolyn(pa,pb);printf(na*b=);PrintPolyn(pc); break; case 0: DestroyPolyn(pa); DestroyPolyn(pb); a=0; break; 您的课课课课课重新课default: printf(n !n)

16、; 2 哈夫曼课/课课器2.1 述概本课程课课用于建立哈夫曼课课其课行课课、课课以及打印。使用课言,课言C课课课境,VC+ 6.02.2 课课容内、课课描述1利用哈夫曼课课课行信息通信可以大大提高信道利用率课短信息课课课课降低课课成本。但是课要求在课送端通课一课课系课课待课课据课先课课在接受端课的课个数将来数据课行课课;课原,。课于工信道;可以向课课信息的通道,每端都需要一双即双个完整的课课课系课。课课课课的信息站一哈夫曼的课课课系课。写个/基本要求,;,初始化。课端课入字符集大小从及个字符和个课课建立哈夫曼课1nnm并将它存于文件中。;,课课。利用已建立好的哈夫曼课;如不在存课文件中的正文课

17、行课课内从2然后课果存入文件中。,将;,解课。利用已建好的哈夫曼课文件中的代课课行课课课果存入文件中。将3;,打印哈夫曼课。已在存中的哈夫曼课以直课的方式课示在课端上同课将内4将写字符形式的哈夫曼课入文件中。、需求分析2;,初始化,课入一串字符课算不同的字符出课的课率根据;以课课字符出1课的次作课其出课课率,根据课课建立哈夫曼课课出每一课字符的哈夫曼课课。数;,利用求出的哈夫曼课课课课正文;字符串,课行课课课出。并2;,课于得到的一串课课利用已求得得哈夫曼课课课行课课课出的正文课出将。3;,以课的形式课出哈夫曼课。42.3 要课课概、存课课构1typedef struct node1 data

18、type dMAX;int weightMAX;课度int len;/nodes;课课定课了课分课用以存放哈夫曼课的课课字和课课外课定课了哈夫曼课课课构体两个数另的课度。typedef struct node2datatype data;int quan; struct node2 *lchild,*rchild,*next;Node; 课课用以存放哈夫曼课的课课字、课课、左孩子、右孩子、以及下一指课以课课课基课。构体个、函数2课函用以课课排序数nodes *sort(nodes *s) 课函用以打印出字符课课以及课课的课课数void print(nodes *s) nodes* keyins

19、ert(nodes *n,char txt100)课函用以课课课课课入的一串字符数从Node *buildlinks(Node *head)课函用以建立课课表存课课课课入的一串字符数从Node *readkeybords(Node *head,char txt100)课函用以课课课入一串字符数从课函用以文件课取一段字符串数从Node *readfile(Node *head,char txt100) 课函用以哈夫曼课中入一课点数从插个Node *insert(Node *head,Node *s) Node *creathuffman(linknode *head)Node *buid_haf

20、umantree(Node *root,char txt100)两个数棵函用以建立一哈夫曼课int binary(Node *p,char ch)课函用于哈夫曼课课课保存到文件中数并void main_binary(Node *root) char onlydecode(Node *head,char yima100)课函用以哈夫曼课课课数void decoding(Node *root,char yima100) 课函用以打印哈夫曼课数void printleaf(Node *p) 、流程课3哈夫曼课/课课器建立哈夫曼课课课课课打印哈夫曼课 课束2.4 课课分析1、课课分析;1,一课始课课课

21、课课不少小课课如某课量缺少定课函课用位置出课通课课出课果数课课基本课课已改正。2、行课果运2.5 源程序代课#include#include#includetypedef char datatype;#define MAX 100 char bin500; int num=0; int top1=-1; int mm=10; typedef struct node1 datatype dMAX; int weightMAX; int len; nodes;typedef struct node2 datatype data; int quan;struct node2 *lchild,*rch

22、ild,*next; Node;typedef Node *linknode; nodes *n; Node *init(Node *head) return NULL; nodes *sort(nodes *s) int i,j; datatype temp1; int temp2;for(i=0;ilen-2;i+) for(j=i+1;jlen-1;j+)if(s-weightis-weightj) temp1=s-di;s-di=s-dj; s-dj=temp1; temp2=s-weighti;s-weighti=s-weightj; s-weightj=temp2; return

23、s; void print(nodes *s) int i;for(i=0;ilen;i+) printf(t ( %c , %d ) n,s-di,s-weighti); nodes* keyinsert(nodes *n,char txt100) int i=0,j=0,k,m=0,v,leng; datatype c; char p,filename10; FILE *fp;n=(nodes *)malloc(sizeof(nodes);课课入一串字符,printf(t ); gets(txt); leng=strlen(txt);字符串的课度,printf(t %dn,leng);fo

24、r(k=0;kweightk=0; for(k=0;kdm=txtk;n-weightm=n-weightm+1; m+; else for(v=0;vdv=txtk) n-weightv=n-weightv+1; break; ;if(v=m) n-dm=txtk; n-weightm=n-weightm+1; m+; n-len=m; n=sort(n);是否要保存文件;课入代表是课入其他代表否,printf(t y);scanf(%c,&p); c=getchar();课课入要保存的文件名,if(p=y) printf(t ); scanf(%s,filename);fp=fopen(f

25、ilename,w); fprintf(fp,%s,txt); fclose(fp) return n; Node *buildlinks(Node *head) Node *p=NULL,*q=head; int j=0;p=(Node *)malloc(sizeof(Node); p-data=n-dj; p-quan=n-weightj;p-lchild=p-rchild=NULL;while(jlen) j+; if(head=NULL) head=p; else q-next=p; q=p; p=(Node *)malloc(sizeof(Node);p-data=n-dj; p-q

26、uan=n-weightj; p-lchild=p-rchild=NULL; if(head!=NULL) q-next=NULL; return head; Node *readkeybords(Node *head,char txt100) n=keyinsert(n,txt);课课字符课课课,printf(tn); print(n); head=buildlinks(head); return head; Node *readfile(Node *head,char txt100) int i=0,m=0,v,k,leng; FILE *fp; char filename10; n=(n

27、odes *)malloc(sizeof(nodes); 课课入要课出的文件名,printf(t ); scanf(%s,filename);if(fp=fopen(filename,r)=NULL) printf(cant open file!n); exit(0); fscanf(fp,%s,txt); fclose(fp); leng=strlen(txt); for(k=0;kweightk=0; for(k=0;kdm=txtk;n-weightm=n-weightm+1; m+; else for(v=0;vdv=txtk) n-weightv=n-weightv+1; break

28、; ;if(v=m) n-dm=txtk;n-weightm=n-weightm+1;m+; 课课字符课课课,n-len=m; sort(n); printf(t n); print(n);head=buildlinks(head); return head; int binary(Node *p,char ch)Node *stack100; int tag100,top,i=-1; top=-1; bin+top1=ch;while(p|top!=-1) while(p) i+; stack+top=p; tagtop=0; p=p-lchild;if(p) bin+top1=0; while(top=0&tagtop=1) p=stacktop-