-
Notifications
You must be signed in to change notification settings - Fork 0
/
Polynomial_Addition.c
203 lines (180 loc) · 4.84 KB
/
Polynomial_Addition.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
#include <stdio.h>
#include <stdlib.h>
struct Node
{
int coeff;
int pow;
struct Node *next;
};
struct Node *poly1 = NULL, *poly2 = NULL, *poly3 = NULL;
struct Node* CreateNode(struct Node*);
struct Node* SortPolynomial(struct Node*);
struct Node* AddPolynomial();
void ShowPolynomial(struct Node*);
struct Node* CreateNode(struct Node *poly)
{
int x, y;
printf("coefficient: ");
scanf("%d", &x);
printf("Power: ");
scanf("%d", &y);
struct Node *new = (struct Node *)malloc(sizeof(struct Node)), *current;
if(new == NULL){
printf("\nMemory error\n");
exit(0);
}
new->coeff = x;
new->pow = y;
new->next = NULL;
if (poly == NULL)
{
poly = new;
}
else
{
current = poly;
while (current->next != NULL)
{
current = current->next;
}
current->next = new;
}
poly = SortPolynomial(poly);
return poly;
}
struct Node* SortPolynomial(struct Node *poly){
struct Node *current, *temp, *bubble;int buff;
for (current = poly; current != NULL; current = current->next)
{
bubble = current;
for (temp = current->next; temp != NULL; temp = temp->next)
{
if (temp->pow > bubble->pow)
{
bubble = temp;
}
}
buff = current->pow;
current->pow = bubble->pow;
bubble->pow = buff;
}
return poly;
}
struct Node* AddPolynomial(struct Node* poly1, struct Node* poly2)
{
struct Node *poly3 = NULL, *current = NULL;
while (poly1 != NULL && poly2 != NULL)
{
struct Node *newNode = (struct Node*)malloc(sizeof(struct Node));
if (newNode == NULL)
{
printf("\nMemory error\n");
exit(0);
}
if (poly1->pow > poly2->pow)
{
newNode->pow = poly1->pow;
newNode->coeff = poly1->coeff;
poly1 = poly1->next;
}
else if (poly1->pow < poly2->pow)
{
newNode->pow = poly2->pow;
newNode->coeff = poly2->coeff;
poly2 = poly2->next;
}
else
{
newNode->pow = poly1->pow;
newNode->coeff = poly1->coeff + poly2->coeff;
poly1 = poly1->next;
poly2 = poly2->next;
}
newNode->next = NULL;
if (poly3 == NULL)
{
poly3 = newNode;
current = poly3;
}
else
{
current->next = newNode;
current = current->next;
}
}
while (poly1 != NULL)
{
struct Node *newNode = (struct Node*)malloc(sizeof(struct Node));
if (newNode == NULL)
{
printf("\nMemory error\n");
exit(0);
}
newNode->pow = poly1->pow;
newNode->coeff = poly1->coeff;
newNode->next = NULL;
current->next = newNode;
current = current->next;
poly1 = poly1->next;
}
while (poly2 != NULL)
{
struct Node *newNode = (struct Node*)malloc(sizeof(struct Node));
if (newNode == NULL)
{
printf("\nMemory error\n");
exit(0);
}
newNode->pow = poly2->pow;
newNode->coeff = poly2->coeff;
newNode->next = NULL;
current->next = newNode;
current = current->next;
poly2 = poly2->next;
}
return poly3;
}
void ShowPolynomial(struct Node *poly)
{
while (poly != NULL)
{
printf("%dx^%d", poly->coeff, poly->pow);
if (poly->next != NULL){
printf(" + ");
}
poly = poly->next;
}
}
int main()
{
printf("\n====================================================\n");
printf("Enter the coefficients and powers for the first poly: \n");
while (1)
{
poly1=CreateNode(poly1);
char choice;
printf("Do you want to add another term (y/n)? ");
scanf(" %c", &choice);
if (choice == 'n')
break;
}
printf("\nEnter the coefficients and powers for the second poly: \n");
while (1)
{
poly2=CreateNode(poly2);
char choice;
printf("Do you want to add another term (y/n)? ");
scanf(" %c", &choice);
if (choice == 'n')
break;
}
printf("\nFirst polynomial: ");
ShowPolynomial(poly1);
printf("\nSecond polynomial: ");
ShowPolynomial(poly2);
printf("\nResultant poly: ");
poly3 = AddPolynomial(poly1, poly2);
ShowPolynomial(poly3);
printf("\n================================================\n");
return 0;
}