Cho hai đa thức A và B viết chương trình cộng hai đa thức A và B đã cho bằng Python
Giả sử, ta có hai đa thức và ta phải tìm phép cộng của hai đa thức đó. Các đa thức phải được biểu diễn dưới dạng danh sách liên kết; . Mỗi nút danh sách được liên kết sẽ chứa giá trị hệ số, giá trị công suất và con trỏ tới nút danh sách được liên kết tiếp theo. Ta phải trả về một danh sách liên kết thứ ba là phép cộng của hai đa thức danh sách liên kết Vì vậy, nếu đầu vào giống như 1x^1 + 1x^2 = 0 và 2x^1 + 3x^0 = 0, thì kết quả sẽ là 3x^1 + 1x^2 + 3x^0 = 0 Để giải quyết vấn đề này, chúng tôi sẽ làm theo các bước sau -
Chúng ta hãy xem triển khai sau đây để hiểu rõ hơn - Thí dụclass polynomial: def __init__(self, coeff = 0, pow = 0, nxt = None): self.coefficient = coeff self.power = pow self.next = nxt def create_poly(expression): head = None for element in expression: if head == None: head = polynomial(element[0], element[1]) else: temp = head while temp.next != None: temp = temp.next if temp.next == None: temp.next = polynomial(element[0], element[1]) return head def show_poly(head): temp = head while temp.next != None: print(str(temp.coefficient) + 'x^' + str(temp.power), end = ' + ') temp = temp.next if temp.next == None: print(str(temp.coefficient) + 'x^' + str(temp.power), end=' = 0') def solve(poly1, poly2): dummy = node = polynomial() while poly1 and poly2: if poly1.power > poly2.power: node.next = node = poly1 poly1 = poly1.next elif poly1.power < poly2.power: node.next = node = poly2 poly2 = poly2.next else: coef = poly1.coefficient + poly2.coefficient if coef: node.next = node = polynomial(coef, poly1.power) poly1 = poly1.next poly2 = poly2.next node.next = poly1 or poly2 return dummy.next poly1 = create_poly([[1,1], [1,2]]) poly2 = create_poly([[2,1], [3, 0]]) poly3 = solve(poly1, poly2) show_poly(poly3) Đầu vàopoly1 = create_poly([[1,1], [1,2]]) poly2 = create_poly([[2,1], [3, 0]]) đầu ra3x^1 + 1x^2 + 3x^0 = 0 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^33 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^35 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^37 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].3 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 // Simple C++ program to add two polynomials 1
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 #include 1
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 #include 9
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 using 9
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 std; 2add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 // Simple C++ program to add two polynomials 1
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 using 9
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].03 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].05
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].11
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].17
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].20 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].21 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].22 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].21 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].24
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].27 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].21_______3_______29 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].21 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].31
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].35 // A utility function to return maximum of two integers 8
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].41 // A utility function to return maximum of two integers 8
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].48
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].55 // A utility function to return maximum of two integers 8
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].62
Javaadd(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].64
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].66 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].67
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].69
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].1 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].3 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].77
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].80
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].84 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].85 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].86
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].90_______3_______0 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^35 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^37 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].3 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].77
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^304 // Simple C++ program to add two polynomials 9 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 #include 1
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^309
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^314 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^315 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^316 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^317 using 1
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^322
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^314 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^315 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^329 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^317 namespace 1
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^341
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].77
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^314 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^315 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^329 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^317_______4_______58 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^317 6 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^361 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^315 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^363 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^364 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^365 // A utility function to return maximum of two integers 0 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^367 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^317 namespace 6First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^317 6 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^372 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^373 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^363 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^364 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^365 // A utility function to return maximum of two integers 7First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^378 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^317 namespace 6
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^386
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].71 namespace 9 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^391
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^396 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^397 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^398 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^315 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^398 // Simple C++ program to add two polynomials 01First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^398 // Simple C++ program to add two polynomials 03// Simple C++ program to add two polynomials 04
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^373 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^398 // Simple C++ program to add two polynomials 13First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^398 // Simple C++ program to add two polynomials 15// Simple C++ program to add two polynomials 04
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^378
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^378
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^378
Python3
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^315 #include 6 // Simple C++ program to add two polynomials 74// Simple C++ program to add two polynomials 75 // Simple C++ program to add two polynomials 76// Simple C++ program to add two polynomials 77
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^315 // Simple C++ program to add two polynomials 89First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^373 // Simple C++ program to add two polynomials 91
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^315 // Simple C++ program to add two polynomials 91First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^317 #include 27#include 7// A utility function to return maximum of two integers 0#include 41// Simple C++ program to add two polynomials 65 #include 30
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^373 // Simple C++ program to add two polynomials 91First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^317 #include 27#include 7// A utility function to return maximum of two integers 7#include 56// Simple C++ program to add two polynomials 65 #include 30
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^397 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^398 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^315_______4_______98 // Simple C++ program to add two polynomials 01First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^398 // Simple C++ program to add two polynomials 03#include 83
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^373 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^398 // Simple C++ program to add two polynomials 13First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^398 // Simple C++ program to add two polynomials 15#include 83
C#
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].66 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].67
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].1 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].3 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 using 75
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].80
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].90_______3_______0 using 95add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 using 97add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].3 add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 // Simple C++ program to add two polynomials 1
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 #include 1
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 namespace 20
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^317 using 1
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 namespace 34
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^317 namespace 1
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 namespace 57
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].0 namespace 34
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^317 namespace 68First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^317 6 namespace 71First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^317 // Simple C++ program to add two polynomials 2First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^364 namespace 75// A utility function to return maximum of two integers 0 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^367 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^317 namespace 6First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^317_______265_______6 namespace 82First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^317 // Simple C++ program to add two polynomials 2First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^364 namespace 75// A utility function to return maximum of two integers 7First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^378 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^317 namespace 6
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].71 namespace 9 std; 02
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^378
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^378
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^378
PHP
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].9 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^30 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^31
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^398 std; 67First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^398 std; 69First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^398 std; 71using 14
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^398 std; 71First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^378
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^398 std; 71using 14
________265 _______8_______265 ______6 First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^317 63 // A utility function to return maximum of two integers 0 76std; 94// A utility function to return maximum of two integers 8________265 _______8_______265_______6
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^378
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^378
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].35 // A utility function to return maximum of two integers 8
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^398 std; 69First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^378
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].41 // A utility function to return maximum of two integers 8
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^378
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^398 std; 67First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^398 std; 69First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^398 std; 71First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^378
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^398 std; 71First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^378
add(A[0..m-1], B[0..n01]) 1) Create a sum array sum[] of size equal to maximum of 'm' and 'n' 2) Copy A[] to sum[]. 3) Travers array B[] and do following for every element B[i] sum[i] = sum[i] + B[i] 4) Return sum[].55 // A utility function to return maximum of two integers 8
First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^398 std; 75First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^378
đầu ra. First polynomial is 5 + 0x^1 + 10x^2 + 6x^3 Second polynomial is 1 + 2x^1 + 4x^2 Sum polynomial is 6 + 2x^1 + 14x^2 + 6x^3 Độ phức tạp về thời gian của thuật toán và chương trình trên là O(m+n) trong đó m và n là bậc của hai đa thức đã cho Cách cộng hai đa thức bằng thuật toán?Bước 1. lặp xung quanh tất cả các giá trị của danh sách được liên kết và làm theo bước 2 & 3. Bước 2. nếu giá trị của số mũ của một nút. tốt hơn là sao chép nút này sang nút kết quả và hướng tới nút tiếp theo. Bước 3. nếu các giá trị của cả hai số mũ của nút giống nhau, hãy thêm các hệ số và sau đó sao chép giá trị đã thêm bằng nút vào kết quả
Làm thế nào để thêm hai đa thức trong c?số hạng của đa thức bậc nhất giảm đi 1 và chỉ số dưới 'i' cũng tiến lên 2. Nếu điều kiện này sai, thì bậc của tổng c[k] trở thành b[j] và c[k+1]=b[j+1]. The no. of terms of second polynomial gets reduced by 1 and the subscript 'j' is moved forward by 2. |