Addition Of Two Polynomials

Addition Of Two Polynomials.

CODE

👇

1. #include <stdio.h>
2. #include <stdlib.h>
3. typedef struct node
4. {
5. int exp, coef;
6. struct node *next;
7. }P;
8. 
   
9. void create(P *p1);
10. void display(P *p1);
11. void add(P *p1, P *p2, P *p3);
12. 
    
13. void main()
14. {
15. P *p1, *p2, *p3, *p4;
16. p1=(P*)malloc(sizeof(P));
17. p1->next=NULL;
18. 
    
19. p2=(P*)malloc(sizeof(P));
20. p2->next=NULL;
21. 
    
22. p3=(P*)malloc(sizeof(P));
23. p3->next=NULL;
24. 
    
25. p4=(P*)malloc(sizeof(P));
26. p4->next=NULL;
27. 
    
28. create(p1);
29. printf("1st Polynomial is:\t");
30. display(p1);
31. printf("\n\n");
32. 
    
33. create(p2);
34. printf("2nd Polynomial is:\t");
35. display(p2);
36. printf("\n\n");
37. 
    
38. add(p1, p2, p3);
39. printf("\n Addition of 1st and 2nd Polynomial is:\n");
40. display(p1);
41. printf("+");
42. display(p2);
43. printf("=");
44. display(p3);
45. printf("\n\n");
46. }
47. 
    
48. void create(P *p1)
49. {
50. P *temp=p1, *nn;
51. int i, n;
52. printf("How many terms you want to enter:");
53. scanf("%d", &n);
54. printf(">>>Enter terms in desending order of power<<<\n");
56. for(i=0; i<n; i++)
57. {
58. nn=(P*)malloc(sizeof(P));
59. nn->next=NULL;
60. printf("Enter coefficient of the term: %d=", i+1);
61. scanf("%d", &nn->coef);
62. printf("Enter exponetial of the term:%d=", i+1);
63. scanf("%d", &nn->exp);
64. 
    
65. if(p1==NULL)
66. p1=temp=nn;
68. temp->next=nn;
69. temp=nn;
70. } 
71. }
72. 
    
73. void display(P *p1)
74. {
75. P *temp;
76. for(temp=p1->next;temp!=NULL; temp=temp->next)
77. printf("[%d^%d]+",temp->coef, temp->exp);
78. printf("\b");
79. }
80. 
    
81. void add(P *p1, P *p2, P *p3)
82. {
83. P *t1=p1->next, *t2=p2->next, *t3=p3, *nn;
84. int i;
85. while(t1 && t2)
86. {
87. nn=(P*)malloc(sizeof(P));
88. nn->next=NULL;
90. if(t1->exp > t2->exp)
91. {
92. nn->exp=t1->exp;
93. nn->coef=t1->coef;
94. t1=t1->next;
95. }
96. else 
97. if(t1->exp < t2->exp)
98. {
99. nn->exp=t2->exp;
100. nn->coef=t2->coef;
101. t2=t2->next;
102. }
103. else
104. if(t1->exp==t2->exp)
105. {
106. nn->exp=t2->exp;
107. nn->coef=t1->coef+t2->coef;
108. t1=t1->next;
109. t2=t2->next;
110. }
111. t3->next=nn;
112. t3=nn;
113. }
115. while(t1)
116. {
117. nn=(P*)malloc(sizeof(P));
118. nn->next=NULL;
119. nn->exp=t1->exp;
120. nn->coef=t1->coef;
121. t3->next=nn;
122. t3=nn;
123. t1=t1->next;
124. }
125. 
     
126. while(t2)
127. {
128. nn=(P*)malloc(sizeof(P));
129. nn->next=NULL;
130. nn->next=NULL;
131. nn->exp=t2->exp;
132. nn->coef=t2->coef;
133. t3->next=nn;
134. t3=nn;
135. t2=t2->next;
136. }
137. }

👉Execute👈

//Output

/*

How many terms you want to enter:2

>>>Enter terms in desending order of power<<<

Enter coefficient of the term: 1=4

Enter exponetial of the term:1=3

Enter coefficient of the term: 2=2

Enter exponetial of the term:2=3

1st Polynomial is: [4^3]+[2^3]+

How many terms you want to enter:2

>>>Enter terms in desending order of power<<<

Enter coefficient of the term: 1=5

Enter exponetial of the term:1=3

Enter coefficient of the term: 2=6

Enter exponetial of the term:2=3

2nd Polynomial is: [5^3]+[6^3]+

 Addition of 1st and 2nd Polynomial is:

[4^3]+[2^3]+[5^3]+[6^3]+=[9^3]+[8^3]+

*/

                                                                                 //ThE ProFessoR