```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 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 ``` ```//USE POINTER NOTATION #include #include #include #include //#include using namespace std; class Polynomial { private: int *coefficient; int counter; public: Polynomial() { coefficient = new int [1]; *coefficient = '\0'; } Polynomial(char *); //copyconstructor Polynomial(const Polynomial &obj) { counter = obj.counter; coefficient = new int[counter]; for (int i = 0; i < counter; i++) *(coefficient + i) = obj.coefficient[i]; } //destructor ~Polynomial() { delete [] coefficient; } void setPolynomial(char *s); void getPolynomial() const { for (int i = 0; i < counter; i++) { cout << coefficient[i] << "x^" << i; if (i != counter - 1) cout << " + "; } } Polynomial operator + (const Polynomial &); Polynomial operator - (const Polynomial &); Polynomial operator * (const Polynomial &); const Polynomial operator=(const Polynomial &right) {; delete [] coefficient; counter = right.counter; coefficient = new int[counter]; for (int i = 0; i < right.counter; i++) *(coefficient + i) = right.coefficient[i]; return *this; } }; int main() { char input[50]; char input2[50]; cout << "Example: -4x^0 + x^1 + 0x^2+ 4x^3 + -3x^4" << endl; cout << "Enter a polynomial: "; cin.getline(input, 50); Polynomial one(input); cout << "Enter second polynomial: "; cin.getline(input2, 50); Polynomial two(input2); int choice; do { cout << "1. Addition\n2. Subtraction\n3. Multiplication"; cout << "\n4. Assignment\n5. Exit\nEnter your choice: "; cin >> choice; switch (choice) { case 1: { cout << "Addiction\n"; Polynomial add = one + two; one.getPolynomial(); cout << " + "; two.getPolynomial(); cout << " = "; add.getPolynomial(); cout << endl; } break; case 2: { cout << "Subtraction\n"; Polynomial subtract = one - two; one.getPolynomial(); cout << " - ("; two.getPolynomial(); cout << ") = "; subtract.getPolynomial(); cout << endl; } break; case 3: { cout << "Multiplication\n"; Polynomial multiply = one * two; one.getPolynomial(); cout << " * ("; two.getPolynomial(); cout << ") = "; multiply.getPolynomial(); cout << endl; } break; case 4: cout << "Assignment\n"; cout << "First polynomial: "; one.getPolynomial(); cout << "\nSecond polynomial: "; two.getPolynomial(); cout << "\nFirst = Second\nFirst polynomial is now: "; one = two; one.getPolynomial(); cout << endl; break; case 5: cout << "Goodbye\n"; break; default: cout << "Invalid choice\n"; break; } }while (choice != 5); return 0; } Polynomial::Polynomial(char *s) { char *string; string = new char [strlen(s) + 1]; int length = strlen(string); strcpy(string, s); char *copy; copy = new char [length]; strcpy(copy, string); char *p = strtok(string, " +-"); counter = 0; while (p) { p = strtok(NULL, " +-"); counter++; } coefficient = new int[counter]; p = strtok(copy, " +"); int a = 0; while (p) { long int coeff; char *endptr; coeff = strtol(p, &endptr, 10); //stops at first non number if (*p == 'x') coeff = 1; coefficient[a] = coeff; p = strtok(NULL, " +"); a++; } } void Polynomial::setPolynomial(char *s) { char *string; string = new char [strlen(s) + 1]; int length = strlen(string); strcpy(string, s); char *copy; copy = new char[length]; strcpy(copy, string); char *p = strtok(string, " +-"); counter = 0; while (p) { p = strtok(NULL, " +-"); counter++; } coefficient = new int[counter]; p = strtok(copy, " +"); int a = 0; while (p) { long int coeff; char *endptr; coeff = strtol(p, &endptr, 10); //stops at first non number if (*p == 'x') coeff = 1; coefficient[a] = coeff; p = strtok(NULL, " +"); a++; } } Polynomial Polynomial::operator + (const Polynomial &right) { Polynomial temp; //string, length, coefficient, counter int smallest, largest; smallest = (counter > right.counter) ? right.counter : counter; largest = (counter > right.counter) ? counter : right.counter; if (counter == right.counter) largest = counter; //make coefficient array temp.counter = largest; temp.coefficient = new int [largest]; for (int i = 0; i < smallest; i++) temp.coefficient[i] = coefficient[i] + right.coefficient[i]; for (int j = smallest; j < largest; j++) { if (counter > right.counter) temp.coefficient[j] = coefficient[j]; else temp.coefficient[j] = right.coefficient[j]; } return temp; } Polynomial Polynomial::operator - (const Polynomial &right) { Polynomial temp; int smallest, largest; smallest = (counter > right.counter) ? right.counter : counter; largest = (counter > right.counter) ? counter : right.counter; if (counter == right.counter) largest = counter; //make coefficient array temp.counter = largest; temp.coefficient = new int [largest]; for (int i = 0; i < smallest; i++) temp.coefficient[i] = coefficient[i] - right.coefficient[i]; for (int j = smallest; j < largest; j++) { if (counter > right.counter) temp.coefficient[j] = coefficient[j]; else temp.coefficient[j] = right.coefficient[j]; } return temp; } Polynomial Polynomial::operator * (const Polynomial &right) { Polynomial temp; //make coefficient array int count = (counter + right.counter) - 1; temp.counter = count; temp.coefficient = new int [count]; for (int i = 0; i < counter; i++) { for (int j = 0; j < right.counter; j++) temp.coefficient[i+j] += coefficient[i] * right.coefficient[j]; } return temp; } ```