-
Notifications
You must be signed in to change notification settings - Fork 1
/
Polynomial_Multiplication.cpp
57 lines (46 loc) · 1.04 KB
/
Polynomial_Multiplication.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
#include <iostream>
void polyProduct(int a1[], int a2[], int n1, int n2) {
int n = n1 + n2;
int*result = new int[n];
for (int i = 0; i < n; ++i) {
result[i] = 0;
}
for (int i = 0; i < n1; i++) {
for (int j = 0; j < n2; ++j) {
result[i + j] += (a1[i]*a2[j]);
std::cout << result[i + j] << " ";
}
}
std::cout << "Result : \n";
for (int i = n-1; i >=0; --i) {
if (result[i] != 0) {
std::cout << result[i] << "x^" << i<<" + ";
}
}
}
int main() {
int* ar1;
int* ar2;
int num = 0;
std::cout << "Enter The Number Of Elements in polynomial 1 : ";
std::cin >> num;
ar1 = new int[num];
std::cout << "Enter The Polynomial One : ";
int i = 0;
while (i != num) {
std::cin >> ar1[i];
++i;
}
int num2 = 0;
std::cout << "Enter The Number Of Elements in polynomial 2 : ";
std::cin >> num2;
ar2 = new int[num2];
std::cout << "Enter The Polynomial One : ";
i = 0;
while (i != num2) {
std::cin >> ar2[i];
++i;
}
polyProduct(ar1, ar2,num,num2);
return 0;
}