{"id":26252,"date":"2017-10-26T20:49:25","date_gmt":"2017-10-26T15:19:25","guid":{"rendered":"https:\/\/www.wikitechy.com\/technology\/?p=26252"},"modified":"2017-10-26T20:49:25","modified_gmt":"2017-10-26T15:19:25","slug":"c-programming-program-add-two-polynomials","status":"publish","type":"post","link":"https:\/\/www.wikitechy.com\/technology\/c-programming-program-add-two-polynomials\/","title":{"rendered":"C++ Programming – Program to add two polynomials"},"content":{"rendered":"

Given two polynomials represented by two arrays, write a function that adds given two polynomials.<\/span><\/p>\n

Example:<\/p>\n

Input:  A[] = {5, 0, 10, 6} \r\n        B[] = {1, 2, 4} \r\nOutput: sum[] = {5, 10, 30, 26, 52, 24}\r\n\r\nThe first input array represents \"5 + 0x^1 + 10x^2 + 6x^3\"\r\nThe second array represents \"1 + 2x^1 + 4x^2\" \r\nAnd Output is \"6 + 2x^1 + 14x^2 + 6x^3\"<\/pre>\n
Addition is simpler than multiplication of polynomials<\/a>. We initialize result as one of the two polynomials, then we traverse the other polynomial and add all terms to the result.<\/p>\n
add(A[0..m-1], B[0..n01])<\/strong>\r\n1) Create a sum array sum[] of size equal to maximum of 'm' and 'n'\r\n2) Copy A[] to sum[].\r\n3) Travers array B[] and do following for every element B[i]\r\n          sum[i] = sum[i] + B[i]\r\n4) Return sum[].<\/pre>\n[ad type=”banner”]\n
The following is C++ implementation of above algorithm.<\/p>\n
 
 C++ Program<\/span> <\/div> 
\/\/ Simple C++ program to add two polynomials#include <iostream>using namespace std; \/\/ A utility function to return maximum of two integersint max(int m, int n) {  return (m > n)? m: n; } \/\/ A[] represents coefficients of first polynomial\/\/ B[] represents coefficients of second polynomial\/\/ m and n are sizes of A[] and B[] respectivelyint *add(int A[], int B[], int m, int n){   int size = max(m, n);   int *sum = new int[size];    \/\/ Initialize the porduct polynomial   for (int i = 0; i<m; i++)     sum[i] = A[i];    \/\/ Take ever term of first polynomial   for (int i=0; i<n; i++)       sum[i] += B[i];    return sum;} \/\/ A utility function to print a polynomialvoid printPoly(int poly[], int n){    for (int i=0; i<n; i++)    {       cout << poly[i];       if (i != 0)        cout << "x^" << i ;       if (i != n-1)       cout << " + ";    }} \/\/ Driver program to test above functionsint main(){    \/\/ The following array represents polynomial 5 + 10x^2 + 6x^3    int A[] = {5, 0, 10, 6};     \/\/ The following array represents polynomial 1 + 2x + 4x^2    int B[] = {1, 2, 4};    int m = sizeof(A)\/sizeof(A[0]);    int n = sizeof(B)\/sizeof(B[0]);     cout << "First polynomial is \\n";    printPoly(A, m);    cout << "\\nSecond polynomial is \\n";    printPoly(B, n);     int *sum = add(A, B, m, n);    int size = max(m, n);     cout << "\\nsumuct polynomial is \\n";    printPoly(sum, size);     return 0;}<\/code><\/pre> <\/div>\n
Output:<\/strong><\/p>\n
First polynomial is\r\n5 + 0x^1 + 10x^2 + 6x^3\r\nSecond polynomial is\r\n1 + 2x^1 + 4x^2\r\nSum polynomial is\r\n6 + 2x^1 + 14x^2 + 6x^3<\/pre>\n
Time complexity <\/strong>of the above algorithm and program is O(m+n) where m and n are orders of two given polynomials.<\/p>\n[ad type=”banner”]\n","protected":false},"excerpt":{"rendered":"
C++ Programming – Program to add two polynomials – Mathematical Algorithms – Addition is simpler than multiplication of polynomials. We initialize result <\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[69969,83515,1,74058],"tags":[78159,78143,78167,77780,78170,77772,78166,70840,78162,78151,77751,78168,77754,78158,77630,78161,78153,78138,78149,73337,78150,78144,78142,78148,78155,78152,78137,78133,78141,78164,78136,78131,78135,78134,78154,77781,77016,78157,78146,78160,78169,78139,75430,78145,78156,78132,78165,78147,78140,78163],"class_list":["post-26252","post","type-post","status-publish","format-standard","hentry","category-algorithm","category-c-programming-3","category-coding","category-mathematical-algorithms","tag-0-1-2-3-4-5","tag-about-matlab","tag-add-polynomials","tag-adding-polynomials-calculator","tag-addition-c-program","tag-addition-of-polynomials","tag-addition-of-two-polynomials","tag-addition-program-in-c","tag-algorithm-for-polynomial-addition","tag-algorithm-for-polynomial-addition-using-array","tag-algorithm-for-polynomial-addition-using-linked-list-in-data-structure","tag-all-matlab","tag-c-addition-program","tag-c-program-addition","tag-c-program-for-addition","tag-c-program-for-addition-of-two-polynomials-using-linked-list","tag-c-program-to-multiply-two-polynomials-using-linked-list","tag-get-matlab","tag-how-to-add-polynomial","tag-linked-list-program-in-c","tag-list-of-polynomials","tag-matlab","tag-matlab-demo","tag-matlab-example-code","tag-matlab-find-function","tag-matlab-matrix-to-vector","tag-matlab-programming-basics","tag-matlab-programming-tutorial","tag-matlab-tutorial","tag-matlab-vector","tag-matrix-in-matlab","tag-matrix-matlab","tag-matrix-tutorial","tag-mbasic","tag-multiplying-polynomials-calculator","tag-polynomial-addition-algorithm-in-data-structure","tag-polynomial-addition-using-array-in-c","tag-polynomial-c-program","tag-polynomial-function","tag-polynomial-programming","tag-r-squared-matlab","tag-sanfoundry-c","tag-simple-addition-program-in-c","tag-simple-c-program-for-addition","tag-sin-4-5","tag-transpose-matrix-matlab","tag-vector-matlab","tag-vector-x","tag-what-is-matlab","tag-write-ac-program-to-add-two-numbers"],"_links":{"self":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26252","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/comments?post=26252"}],"version-history":[{"count":0,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/posts\/26252\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/media?parent=26252"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/categories?post=26252"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.wikitechy.com\/technology\/wp-json\/wp\/v2\/tags?post=26252"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}