-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathpolynomial_addition.c
85 lines (79 loc) · 2.13 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
#include <stdio.h>
typedef struct
{
int coeff;
int expo;
} polynomial;
int main()
{
int size1, size2;
polynomial p1[20], p2[20], sum[40];
printf("Enter the no. of terms of 1st polynomial: ");
scanf("%d", &size1);
for (int i = 0; i < size1; i++){
printf("Enter coefficient :");
scanf("%d", &p1[i].coeff);
printf("Enter power :");
scanf("%d", &p1[i].expo);
}
printf("Enter the no. of terms of 2nd polynomial: ");
scanf("%d", &size2);
for (int i = 0; i < size2; i++){
printf("Enter coefficient :");
scanf("%d", &p2[i].coeff);
printf("Enter power :");
scanf("%d", &p2[i].expo);
}
printf("\nPolynomial 1 = %dx^%d", p1[0].coeff,p1[0].expo);
for (int i = 1; i < size1; i++)
printf("+ %dx^%d", p1[i].coeff, p1[i].expo);
printf("\nPolynomial 2 = %dx^%d", p2[0].coeff,p2[0].expo);
for (int i = 1; i < size2; i++)
printf("+%dx^%d ", p2[i].coeff, p2[i].expo);
printf("\n");
int i = 0, j = 0, z = 0;
while (i < size1 && j < size2)
{
if (p1[i].expo > p2[j].expo)
{
sum[z].expo = p1[i].expo;
sum[z].coeff = p1[i].coeff;
i++;
z++;
}
else if (p1[i].expo < p2[j].expo)
{
sum[z].expo = p2[j].expo;
sum[z].coeff = p2[j].coeff;
j++;
z++;
}
else
{
sum[z].expo = p1[i].expo;
sum[z].coeff = p1[i].coeff + p2[j].coeff;
z++;
i++;
j++;
}
}
while (i < size1)
{
sum[z].expo = p1[i].expo;
sum[z].coeff = p1[i].coeff;
i++;
z++;
}
while (j < size2)
{
sum[z].expo = p2[j].expo;
sum[z].coeff = p2[j].coeff;
j++;
z++;
}
printf("\nPolynomial expression after additon = %dx^%d", sum[0].coeff,sum[0].expo);
for (int i = 1; i < z; i++)
printf("+ %dx^%d", sum[i].coeff, sum[i].expo);
printf("\n");
return 0;
}