Scribd Logo
Upload

Welcome to Scribd!

  • HW 3

    Uploaded by

    bossun113
    10 views2 pages
    The inputTerm function inserts a new term into a polynomial term array. It searches for the insertion point based on the exponent, shifts later terms over as needed, and inserts the term with the given coefficient and exponent. The addArrayBasedPoly function adds two polynomial term arrays and stores the result in a third array. It iterates through both input arrays in parallel, copying terms over where the exponents match and the coefficients are added, or inserting the larger exponent term when they differ.

    Original Description:

    Original Title

    hw3

    Copyright

    © © All Rights Reserved

    Available Formats

    TXT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The inputTerm function inserts a new term into a polynomial term array. It searches for the insertion point based on the exponent, shifts later terms over as needed, and inserts the term with the given coefficient and exponent. The addArrayBasedPoly function adds two polynomial term arrays and stores the result in a third array. It iterates through both input arrays in parallel, copying terms over where the exponents match and the coefficients are added, or inserting the larger exponent term when they differ.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    10 views2 pages

    HW 3

    Uploaded by

    bossun113
    The inputTerm function inserts a new term into a polynomial term array. It searches for the insertion point based on the exponent, shifts later terms over as needed, and inserts the term with the given coefficient and exponent. The addArrayBasedPoly function adds two polynomial term arrays and stores the result in a third array. It iterates through both input arrays in parallel, copying terms over where the exponents match and the coefficients are added, or inserting the larger exponent term when they differ.

    Copyright:

    © All Rights Reserved
    Download as TXT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 2

    void inputTerm(polynomialTerm t[], int coef, int expo)

    {
    for (int i = 0; i < MAX_TERMS; i++)
    {
    if (t[i].expo < expo)
    {
    if (t[i].coef != 0)
    {
    for (int j = MAX_TERMS; j > i; j--)
    {
    t[j] = t[j - 1];
    }
    }
    t[i].coef = coef;
    t[i].expo = expo;

    break;
    }
    else if (t[i].expo == expo)
    {
    t[i].coef = coef;
    if(t[i].coef==0)
    {
    for (int j = i; j < MAX_TERMS; j++)
    {
    t[j] = t[j + 1];
    }
    }
    break;
    }
    else if (i == MAX_TERMS - 1)
    {
    t[i].coef = coef;
    t[i].expo = expo;
    break;
    }
    }

    return;
    }

    void addArrayBasedPoly(polynomialTerm a[], polynomialTerm b[], polynomialTerm d[])


    {
    for (int i = 0, j = 0, z = 0; i < MAX_TERMS, j < MAX_TERMS;)//coef^expo
    {
    if (a[i].coef == 0 && b[j].coef == 0)
    break;
    if (a[i].expo == b[j].expo)
    {
    if (a[i].coef + b[j].coef == 0) {}
    else
    {
    d[z].coef = a[i].coef + b[j].coef;
    d[z].expo = a[i].expo;
    z++;
    }
    i++;
    j++;
    }
    else if (a[i].expo < b[j].expo)
    {
    d[z].coef = b[j].coef;
    d[z].expo = b[j].expo;
    j++;
    z++;

    }
    else
    {
    d[z].coef = a[i].coef;
    d[z].expo = a[i].expo;
    i++;
    z++;
    }

    return;
    }

    You might also like