lab09.cpp
Problem Statement
lab09.cpp
Q: Write a program to scan a polynomial using linked list and add two polynomials.
Source Code
cpp
#include<iostream>
using namespace std;
template <class T>
struct node {
T coeff;
int exp; // making it integer to make things easier, so things doesn't get messy with decimal numbers.
node<T> *next = nullptr;
};
template <class T>
class polynomial {
private:
node<T> *head1 = nullptr;
node<T> *head2 = nullptr;
node<T> *head3 = nullptr;
public:
polynomial() {}
void takeInput(int p) {
node<T> *head = nullptr;
int elem;
cout << "\nHow many elements do you want to add: ";
cin >> elem;
for(int i = 0; i < elem; i++) {
node<T> *newNode = new node<T>;
cout << "Enter the the coefficient and exponent: ";
cin >> newNode->coeff >> newNode->exp;
if(head == nullptr) {
head = newNode;
} else {
node<T> *temp = head;
while(temp->next != nullptr) {
temp = temp->next;
}
temp->next = newNode;
}
}
cout << "\nEntered polynomial: ";
display(head);
if(p == 1) {
head1 = head;
} else if(p == 2) {
head2 = head;
}
head = nullptr;
}
void result() {
node<T> *temp1 = head1;
node<T> *temp2 = head2;
while(temp1 != nullptr && temp2 != nullptr) {
node<T> *newNode = new node<T>;
if(temp1->exp == temp2->exp) {
newNode->coeff = temp1->coeff + temp2->coeff;
if (newNode->coeff == 0) {
temp1 = temp1->next;
temp2 = temp2->next;
delete newNode;
continue;
}
newNode->exp = temp1->exp;
temp1 = temp1->next;
temp2 = temp2->next;
} else if(temp1->exp > temp2->exp) {
newNode->coeff = temp1->coeff;
newNode->exp = temp1->exp;
temp1 = temp1->next;
} else if(temp2->exp > temp1->exp) {
newNode->coeff = temp2->coeff;
newNode->exp = temp2->exp;
temp2 = temp2->next;
}
if(head3 == nullptr) {
head3 = newNode;
} else {
node<T> *temp = head3;
while(temp->next != nullptr) {
temp = temp->next;
}
temp->next = newNode;
}
}
while(temp1 != nullptr) {
node<T> *newNode = new node<T>;
newNode->coeff = temp1->coeff;
newNode->exp = temp1->exp;
if(head3 == nullptr) {
head3 = newNode;
} else {
node<T> *temp = head3;
while(temp->next != nullptr) {
temp = temp->next;
}
temp->next = newNode;
}
temp1 = temp1->next;
}
while(temp2 != nullptr) {
node<T> *newNode = new node<T>;
newNode->coeff = temp2->coeff;
newNode->exp = temp2->exp;
if(head3 == nullptr) {
head3 = newNode;
} else {
node<T> *temp = head3;
while(temp->next != nullptr) {
temp = temp->next;
}
temp->next = newNode;
}
temp2 = temp2->next;
}
display(head3);
}
void display(node<T> *head) {
node<T> *temp = head;
while(temp != nullptr) {
cout << "(" << temp->coeff << ")" << "x^" << temp->exp;
temp = temp->next;
if(temp != nullptr) {
cout << " + ";
}
}
}
~polynomial() {
node<T> *temp = nullptr;
node<T> *nextNode = nullptr;
temp = head1;
while(temp != nullptr) {
nextNode = temp->next;
delete temp;
temp = nextNode;
}
head1 = nullptr;
temp = head2;
while(temp != nullptr) {
nextNode = temp->next;
delete temp;
temp = nextNode;
}
head2 = nullptr;
temp = head3;
while(temp != nullptr) {
nextNode = temp->next;
delete temp;
temp = nextNode;
}
head3 = nullptr;
cout << "\n\nMemory cleared.\n";
}
};
int main() {
polynomial<int> obj;
cout << "\nPlease enter p1: ";
obj.takeInput(1);
cout << "\n\nPlease enter p2: ";
obj.takeInput(2);
cout << "\n\nResult: \n";
obj.result();
return 0;
}
// hell yeah, it works.......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
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