-
Notifications
You must be signed in to change notification settings - Fork 1
/
polyadd.c
125 lines (109 loc) · 2.41 KB
/
polyadd.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
#include<stdio.h>
#include<stdlib.h>
typedef struct node{
int coef;
int exp;
struct node* link;
}node;
node* phead=NULL;
node* qhead=NULL;
node rhead1;
node* rhead=&rhead1;
//rhead->link=NULL;
void display(node* head){
node* temp=head;
printf("\n\n");
while(temp!=NULL){
printf("%dx^%d\t",temp->coef,temp->exp);
if(temp->link!=NULL) printf(" ");
temp=temp->link;
}
printf("\n\n");
}
node* insert(node* head){
int deg,coef;
node* ptr;
printf("Enter the degree of the polynomial:");
scanf("%d",°);
for(int i=deg;i>=0;i--){
printf("Enter the coefficent of x^%d:",i);
scanf("%d",&coef);
if(coef!=0){
node* newnode=(node*)malloc(sizeof(node));
newnode->coef=coef;
newnode->exp=i;
newnode->link=NULL;
if(head==NULL){
head=newnode;
}
else{
ptr=head;
while(ptr->link!=NULL){
ptr=ptr->link;
}
ptr->link=newnode;
}
}
}
return head;
}
node* addition(){
node* rptr=rhead;
node* pptr=phead;
node* qptr=qhead;
while(pptr!=NULL && qptr!=NULL){
if((pptr->exp)==(qptr->exp)){
node* newnode=(node*)malloc(sizeof(node));
newnode->coef=((pptr->coef) (qptr->coef));
newnode->exp=pptr->exp;
newnode->link=NULL;
rptr->link=newnode;
pptr=pptr->link;
qptr=qptr->link;
}
else if((pptr->exp)>(qptr->exp)){
node* newnode=(node*)malloc(sizeof(node));
newnode->coef=pptr->coef;
newnode->exp=pptr->exp;
newnode->link=NULL;
rptr->link=newnode;
pptr=pptr->link;
}
else if((pptr->exp)<(qptr->exp)){
node* newnode=(node*)malloc(sizeof(node));
newnode->coef=qptr->coef;
newnode->exp=qptr->exp;
newnode->link=NULL;
rptr->link=newnode;
qptr=qptr->link;
}
rptr=rptr->link;
}
while(pptr!=NULL){
node* newnode=(node*)malloc(sizeof(node));
rptr->coef=pptr->coef;
rptr->exp=pptr->exp;
//rptr->link=NULL;
pptr=pptr->link;
rptr=rptr->link;
}
while(qptr!=NULL){
node* newnode=(node*)malloc(sizeof(node));
rptr->coef=qptr->coef;
rptr->exp=qptr->exp;
//rptr->link=NULL;
qptr=qptr->link;
rptr=rptr->link;
}
}
void main(){
printf("First Polynimial\n");
phead=insert(phead);
display(phead);
printf("Second polynomial\n");
qhead=insert(qhead);
display(qhead);
addition();
rhead=rhead->link;
display(rhead);
}