forked from abbh07/DataStructure-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
List-Polynomial.cpp
166 lines (160 loc) · 2.63 KB
/
List-Polynomial.cpp
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
#include <iostream>
#include <cstdlib>
using namespace std;
class Polynomial
{
private:
int constant;
int exponent;
Polynomial* next;
public:
Polynomial()
{
constant=exponent=0;
next=NULL;
}
Polynomial* insert(Polynomial*,int,int);
void display(Polynomial*);
Polynomial* add(Polynomial*,Polynomial*);
};
Polynomial* Polynomial::insert(Polynomial* po,int c,int e)
{
Polynomial* p = new Polynomial();
p->constant=c;
p->exponent=e;
p->next=NULL;
Polynomial* h = po;
if(po==NULL)
{
po=h=p;
}
else
{
while(po->next!=NULL)
{
po=po->next;
}
po->next=p;
}
return h;
}
void Polynomial::display(Polynomial* po)
{
if(po==NULL)
{
cout<<"Empty List!\n";
}
else
{
while(po!=NULL)
{
cout<<po->constant<<"X^"<<po->exponent<<"+";
po=po->next;
}
cout<<endl;
}
}
Polynomial* Polynomial::add(Polynomial* h1,Polynomial* h2)
{
if(h1==NULL)
return h2;
if(h2==NULL)
return h1;
Polynomial* h3=NULL;
Polynomial* three ;
Polynomial* temp;
while(h1!=NULL && h2!=NULL)
{
temp = new Polynomial();
if(h1->exponent==h2->exponent)
{
temp->exponent=h1->exponent;
temp->constant=(h1->constant+h2->constant);
temp->next=NULL;
h1=h1->next;
h2=h2->next;
}
else if(h1->exponent>h2->exponent)
{
temp->exponent=h1->exponent;
temp->constant=h1->constant;
temp->next=NULL;
h1=h1->next;
}
else if(h2->exponent>h1->exponent)
{
temp->exponent=h2->exponent;
temp->constant=h2->constant;
temp->next=NULL;
h2=h2->next;
}
if(h3==NULL)
{
h3=three=temp;
}
else
{
h3->next=temp;
h3=h3->next;
}
}
while(h1!=NULL)
{
temp=new Polynomial();
temp->next=NULL;
temp->constant=h1->constant;
temp->exponent=h1->exponent;
h3->next=temp;
h3=h3->next;
h1=h1->next;
}
while(h2!=NULL)
{
temp=new Polynomial();
temp->next=NULL;
temp->constant=h2->constant;
temp->exponent=h2->exponent;
h3->next=temp;
h3=h3->next;
h2=h2->next;
}
return three;
}
int main()
{
Polynomial *head1=NULL,*head2=NULL,*head3=NULL;
Polynomial p;
cout<<"Enter the number of elements in the first polynomial\n";
int n;
cin>>n;
int e;
int c;
while(n>0)
{
cout<<"Enter the exponent\n";
cin>>e;
cout<<"Enter the constant\n";
cin>>c;
head1=p.insert(head1,c,e);
n--;
}
cout<<"Enter the number of elements in the second polynomial\n";
cin>>n;
while(n>0)
{
cout<<"Enter the exponent\n";
cin>>e;
cout<<"Enter the constant\n";
cin>>c;
head2=p.insert(head2,c,e);
n--;
}
cout<<"First Polynomial:\n";
p.display(head1);
cout<<"Second Polynomial:\n";
p.display(head2);
head3 = p.add(head1,head2);
cout<<"Result after addition:\n";
p.display(head3);
return 0;
}