-
Notifications
You must be signed in to change notification settings - Fork 0
/
addPolynomial.c
229 lines (211 loc) · 7.61 KB
/
addPolynomial.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
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
#include<stdio.h>
#include<stdlib.h>
struct node{
int coeff;
int power;
struct node *next;
};
struct node *head1, *tail1 = NULL;
struct node *head2, *tail2 = NULL;
struct node *head3, *tail3 = NULL;
void create1(int coeff,int power){
struct node *newnode = (struct node *)malloc(sizeof(struct node));
newnode -> coeff = coeff;
newnode -> power = power;
newnode -> next = NULL;
if (head1 == NULL)
{
head1 = newnode;
tail1 = newnode;
}
else
{
tail1->next = newnode;
tail1 = tail1->next;
}
}
void display1(){
struct node *current = head1;
if (head1 == NULL){
printf("Empty Linked List\n");
return;
}
printf("Elements of Linked list are:\n");
while(current !=NULL)
{
printf("%dx^%d\t", current->coeff,current->power);
//printf("%5d\t", current->pow);
printf("%5ld\t",(long)current->next);
printf("%5ld\t",(long)current);
printf("\n");
current = current->next;
}
}
void create2(int coeff,int power){
struct node *newnode = (struct node *)malloc(sizeof(struct node));
newnode -> coeff = coeff;
newnode -> power = power;
newnode -> next = NULL;
if (head2 == NULL)
{
head2 = newnode;
tail2 = newnode;
}
else
{
tail2->next = newnode;
tail2 = tail2->next;
}
}
void display2(){
struct node *current = head2;
if (head2 == NULL){
printf("Empty Linked List\n");
return ;
}
printf("Elements of Linked list are:\n");
while(current !=NULL)
{
printf("%dx^%d\t", current->coeff,current->power);
printf("%5ld\t",(long)current->next);
printf("%5ld\t",(long)current);
printf("\n");
current = current->next;
}
}
void compare(){
struct node *current = head1;
struct node *temp = head2;
// struct node *result=(struct node *)malloc(sizeof(struct node));
while (current != NULL )
{ if (temp == NULL || current == NULL){
break;
}
else if(current->power == temp->power){
struct node *result=(struct node *)malloc(sizeof(struct node));
result -> coeff = current -> coeff + temp -> coeff;
result -> power = current -> power;
result -> next = NULL;
if (head3 == NULL) {
head3 = result;
tail3 = result;
}
else{
tail3->next = result;
tail3 = result;
}
current = current ->next;
temp = temp -> next;
}
else if(temp->power > current ->power) {
struct node *result=(struct node *)malloc(sizeof(struct node));
result -> coeff = temp -> coeff;
result -> power = temp -> power;
result -> next = NULL;
if (head3 == NULL) {
head3 = result;
tail3 = result;
} else {
tail3->next = result;
tail3 = result;
}
temp = temp->next;
}
else if (current->power > temp->power){
struct node *result=(struct node *)malloc(sizeof(struct node));
result -> coeff = current -> coeff;
result -> power = current -> power;
result -> next = NULL;
if (head3 == NULL) {
head3 = result;
tail3 = result;
} else {
tail3->next = result;
tail3 = result;
}
current = current->next;
}
else{
break;
}
}
if(temp != NULL){
struct node *result=(struct node *)malloc(sizeof(struct node));
result -> coeff = temp -> coeff;
result -> power = temp -> power;
result -> next = NULL;
if (head3 == NULL) {
head3 = result;
tail3 = result;
} else {
tail3->next = result;
tail3 = result;
}
temp = temp->next;
}
else if(current != NULL){
struct node *result=(struct node *)malloc(sizeof(struct node));
result -> coeff = current -> coeff;
result -> power = current -> power;
result -> next = NULL;
if (head3 == NULL) {
head3 = result;
tail3 = result;
} else {
tail3->next = result;
tail3 = result;
}
current = current->next;
}
}
void display(){
struct node *current = head3;
if (head3 == NULL){
printf("Empty Linked List\n");
return ;
}
printf("Elements of Linked list are:\n");
while(current !=NULL)
{
printf("%dx^%d\t", current->coeff,current->power);
printf("%5ld\t",(long)current->next);
printf("%5ld\t",(long)current);
printf("\n");
current = current->next;
}
}
int main(){
int ch=0;
int coeff;
int power;
int pos;
while (1){
printf("1.Create P1 2.Display P1 3.Create P2 4.Display P2 5.Compare 6.Display result 7.Exit\n");
printf("enter choice:");
scanf("%d",&ch);
switch(ch){
case 1: printf("enter coeff:");
scanf("%d",&coeff);
printf("enter power:");
scanf("%d",&power);
create1(coeff,power);
break;
case 2: display1();
break;
case 3: printf("enter coeff:");
scanf("%d",&coeff);
printf("enter power:");
scanf("%d",&power);
create2(coeff,power);
break;
case 4: display2();
break;
case 5: compare();
break;
case 6: display();
break;
case 7: exit(0);
}
}
return 0;
}