-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathlab3-using array.c
129 lines (127 loc) · 3.08 KB
/
lab3-using array.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
// this is program to add two polynomials using arrays
#include <stdio.h>
#include <stdlib.h>
struct polynomial
{
int coeff;
int exp;
}p[10],q[10],r[10];
int n,m;
//array implementation method 1
void main(){
int i=0,j=0,k=0;
printf("Enter the number of terms in the first polynomial: ");
scanf("%d", &n);
printf("Enter the number of terms in the second polynomial: ");
scanf("%d", &m);
printf("Enter the coefficient and exponent of the first polynomial: ");
read_poly(p,n);
printf("Enter the coefficient and exponent of the second polynomial: ");
read(q,m);
add(p,q,r,n,m);
}
void read_poly(struct polynomial p[],int n){
int i;
for (i = 0; i < n; i++)
{
scanf("%d%d", &p[i].coeff, &p[i].exp);
}
}
void add(){
int i=0,j=0,k=0;
while (i < n && j < m)
{
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 < n)
{
r[k].coeff = p[i].coeff;
r[k].exp = p[i].exp;
i++;
k++;
}
while (j < m)
{
r[k].coeff = q[j].coeff;
r[k].exp = q[j].exp;
j++;
k++;
}
printf("The sum of the two polynomials is: ");
for (i = 0; i < k; i++)
{
printf("%dx^%d", r[i].coeff, r[i].exp);
if (i != k - 1)
{
printf(" + ");
}
}
}
//array implementation method2
// void main(){
// struct polynomial p[10];
// int i, j, k, n, m, flag;
// printf("Enter the number of terms in the first polynomial: ");
// scanf("%d", &n);
// printf("Enter the number of terms in the second polynomial: ");
// scanf("%d", &m);
// printf("Enter the coefficient and exponent of the first polynomial: ");
// for (i = 0; i < n; i++)
// {
// scanf("%d%d", &p[i].coeff, &p[i].exp);
// }
// printf("Enter the coefficient and exponent of the second polynomial: ");
// for (j = 0; j < m; j++)
// {
// scanf("%d%d", &p[i].coeff, &p[i].exp);
// i++;
// }
// k = i;
// for (i = 0; i < k; i++)
// {
// flag = 0;
// for (j = i + 1; j < k; j++)
// {
// if (p[i].exp == p[j].exp)
// {
// p[i].coeff = p[i].coeff + p[j].coeff;
// p[j].coeff = 0;
// flag = 1;
// }
// }
// if (flag == 1)
// {
// p[i].coeff = p[i].coeff + p[j].coeff;
// p[j].coeff = 0;
// }
// }
// printf("The resultant polynomial is: ");
// for (i = 0; i < k; i++)
// {
// if (p[i].coeff != 0)
// {
// printf("%dx^%d", p[i].coeff, p[i].exp);
// }
// }
// }