-
Notifications
You must be signed in to change notification settings - Fork 0
/
poly add linkedlist
114 lines (114 loc) · 1.75 KB
/
poly add linkedlist
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
#include<stdio.h>
#include<stdlib.h>
struct node
{
int coeff;
int degree;
struct node *next;
}*head1=NULL,*head2=NULL,*head3=NULL,*current1=NULL,*current2=NULL,*current3=NULL;
void main()
{
int r,i;
struct node *newnode,*ptr1,*ptr2;
printf("enter the maximum degree");
scanf("%d",&r);
printf("enter the details of first polynomial\n");
for(i=r;i>=0;i--)
{
newnode=(struct node *)malloc(sizeof(struct node));
printf("enter the coefficient of degree %d\n",i);
scanf("%d",&newnode->coeff);
newnode->degree=i;
newnode->next=NULL;
if(i==r)
{
head1=newnode;
current1=newnode;
}
else
{
current1->next=newnode;
current1=newnode;
}
}
printf("enter the details of second polynomial\n");
for(i=r;i>=0;i--)
{
newnode=(struct node *)malloc(sizeof(struct node));
printf("enter the coefficient of degree %d\n",i);
scanf("%d",&newnode->coeff);
newnode->degree=i;
newnode->next=NULL;
if(i==r)
{
head2=newnode;
current2=newnode;
}
else
{
current2->next=newnode;
current2=newnode;
}
}
ptr1=head1;
ptr2=head2;
for(i=r;i>=0;i--)
{
newnode=(struct node *)malloc(sizeof(struct node));
newnode->coeff=ptr1->coeff + ptr2->coeff;
newnode->degree=i;
newnode->next=NULL;
ptr1=ptr1->next;
ptr2=ptr2->next;
if(i==r)
{
head3=newnode;
current3=newnode;
}
else
{
current3->next=newnode;
current3=newnode;
}
}
ptr1=head1;
printf("the sum of polynomial ");
for(i=r;i>=0 && ptr1!=NULL;i--)
{
if(ptr1->next!=NULL)
{
printf("%dx^%d+",ptr1->coeff,r);
ptr1=ptr1->next;
}
else
{
printf("%d and",ptr1->coeff);
}
}
ptr1=head2;
for(i=r;i>=0 && ptr1!=NULL;i--)
{
if(ptr1->next!=NULL)
{
printf("%dx^%d+",ptr1->coeff,r);
ptr1=ptr1->next;
}
else
{
printf("%d is\n",ptr1->coeff);
}
}
ptr1=head3;
for(i=r;i>=0 && ptr1!=NULL;i--)
{
if(ptr1->next!=NULL)
{
printf("%dx^%d+",ptr1->coeff,r);
ptr1=ptr1->next;
}
else
{
printf("%d",ptr1->coeff);
}
}
}