-
Notifications
You must be signed in to change notification settings - Fork 1
/
polynomial_add.c
90 lines (76 loc) · 2.01 KB
/
polynomial_add.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
#include <stdio.h>
struct poly {
float coeff;
int exp;
};
void readPolynomial(struct poly P[], int n) {
printf("Enter the coefficients and exponents of the polynomial:\n");
for (int i = 0; i < n; i++) {
printf("Term %d: Coefficient: ", i + 1);
scanf("%f", &P[i].coeff);
printf(" Exponent : ");
scanf("%d", &P[i].exp);
}
}
void displayPolynomial(struct poly P[], int n, const char* name) {
printf("\n%s Polynomial: ", name);
for (int i = 0; i < n; i++) {
printf("%.2fx^%d ", P[i].coeff, P[i].exp);
if (i < n - 1) {
printf("+ ");
}
}
printf("\n");
}
void addPolynomials(struct poly P[], int m, struct poly Q[], int n, struct poly R[], int* r_size) {
int i = 0, j = 0, k = 0;
while (i < m && j < n) {
if (P[i].exp == Q[j].exp) {
R[k].coeff = P[i].coeff + Q[j].coeff;
R[k].exp = P[i].exp;
i++;
j++;
k++;
} else if (P[i].exp > Q[j].exp) {
R[k].coeff = P[i].coeff;
R[k].exp = P[i].exp;
i++;
k++;
} else {
R[k].coeff = Q[j].coeff;
R[k].exp = Q[j].exp;
j++;
k++;
}
}
while (i < m) {
R[k].coeff = P[i].coeff;
R[k].exp = P[i].exp;
i++;
k++;
}
while (j < n) {
R[k].coeff = Q[j].coeff;
R[k].exp = Q[j].exp;
j++;
k++;
}
*r_size = k;
}
int main() {
int m, n, r_size;
printf("Enter the number of terms in the first polynomial: ");
scanf("%d", &m);
struct poly P[m];
readPolynomial(P, m);
printf("Enter the number of terms in the second polynomial: ");
scanf("%d", &n);
struct poly Q[n];
readPolynomial(Q, n);
struct poly R[m + n];
addPolynomials(P, m, Q, n, R, &r_size);
displayPolynomial(P, m, "First");
displayPolynomial(Q, n, "Second");
displayPolynomial(R, r_size, "Sum");
return 0;
}