Scribd Logo
Upload

Welcome to Scribd!

  • HW 4

    Uploaded by

    bossun113
    5 views3 pages
    The inputLinkTerms function takes in a linked polynomial term pointer, coefficient, and exponent. It inserts the term into the linked list by first allocating memory for a new node. It then traverses the list to find the correct insertion point based on comparing exponents. The term is inserted before or replacing the node at that position as needed. The addLinkBasedPoly function adds two linked polynomial terms represented as lists. It recursively traverses both lists term by term, creating and linking new nodes to store the sums. Terms with matching exponents have their coefficients summed, and traversal continues on the remaining nodes. The resulting linked list is returned.

    Original Description:

    Original Title

    hw4

    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 inputLinkTerms function takes in a linked polynomial term pointer, coefficient, and exponent. It inserts the term into the linked list by first allocating memory for a new node. It then traverses the list to find the correct insertion point based on comparing exponents. The term is inserted before or replacing the node at that position as needed. The addLinkBasedPoly function adds two linked polynomial terms represented as lists. It recursively traverses both lists term by term, creating and linking new nodes to store the sums. Terms with matching exponents have their coefficients summed, and traversal continues on the remaining nodes. The resulting linked list is returned.

    Copyright:

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

    HW 4

    Uploaded by

    bossun113
    The inputLinkTerms function takes in a linked polynomial term pointer, coefficient, and exponent. It inserts the term into the linked list by first allocating memory for a new node. It then traverses the list to find the correct insertion point based on comparing exponents. The term is inserted before or replacing the node at that position as needed. The addLinkBasedPoly function adds two linked polynomial terms represented as lists. It recursively traverses both lists term by term, creating and linking new nodes to store the sums. Terms with matching exponents have their coefficients summed, and traversal continues on the remaining nodes. The resulting linked list is returned.

    Copyright:

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

    void inputLinkTerms(linkedPolynomialTerm*& polyPtr, int coef, int expo)

    {
    linkedPolynomialTerm* tmpPtr;
    linkedPolynomialTerm* pre = nullptr;
    linkedPolynomialTerm* cur = polyPtr;

    tmpPtr = new linkedPolynomialTerm;


    tmpPtr->coef = coef;
    tmpPtr->expo = expo;
    tmpPtr->nextTermPtr = nullptr;

    if (polyPtr == nullptr)
    {
    if (tmpPtr->coef == 0)
    return;
    polyPtr = tmpPtr;
    return;
    }
    while (expo < cur->expo)
    {
    if (cur->nextTermPtr == 0)
    {
    if (tmpPtr->coef == 0)
    return;
    cur->nextTermPtr = tmpPtr;
    return;
    }
    else
    {
    pre = cur;
    cur = cur->nextTermPtr;
    }
    }

    if (cur->expo == expo)
    {
    cur->coef = coef;
    if (cur->coef == 0)
    {
    if (pre != nullptr)
    pre->nextTermPtr = cur->nextTermPtr;
    else
    polyPtr = cur->nextTermPtr;
    }
    return;
    }

    if (tmpPtr->coef == 0)
    return;

    if (pre != nullptr)
    {
    tmpPtr->nextTermPtr = cur;
    pre->nextTermPtr = tmpPtr;
    }
    else
    {
    tmpPtr->nextTermPtr = cur;
    polyPtr = tmpPtr;
    }
    return;
    }

    linkedPolynomialTerm* addLinkBasedPoly(linkedPolynomialTerm* aPtr,


    linkedPolynomialTerm* bPtr)
    {
    linkedPolynomialTerm* dPtr = nullptr;

    if (aPtr == nullptr && bPtr == nullptr)


    return 0;

    if (aPtr != nullptr && bPtr == nullptr)


    {
    dPtr = new linkedPolynomialTerm;
    dPtr->coef = aPtr->coef;
    dPtr->expo = aPtr->expo;

    dPtr->nextTermPtr = addLinkBasedPoly(aPtr->nextTermPtr, bPtr);


    }
    else if (aPtr == nullptr && bPtr != nullptr)
    {
    dPtr = new linkedPolynomialTerm;
    dPtr->coef = bPtr->coef;
    dPtr->expo = bPtr->expo;

    dPtr->nextTermPtr = addLinkBasedPoly(aPtr, bPtr->nextTermPtr);


    }
    else if (aPtr->expo > bPtr->expo)
    {
    dPtr = new linkedPolynomialTerm;
    dPtr->coef = aPtr->coef;
    dPtr->expo = aPtr->expo;

    dPtr->nextTermPtr = addLinkBasedPoly(aPtr->nextTermPtr, bPtr);


    }
    else if (aPtr->expo < bPtr->expo)
    {
    dPtr = new linkedPolynomialTerm;
    dPtr->coef = bPtr->coef;
    dPtr->expo = bPtr->expo;

    dPtr->nextTermPtr = addLinkBasedPoly(aPtr, bPtr->nextTermPtr);


    }
    else if (aPtr->expo == bPtr->expo)
    {
    if (aPtr->coef + bPtr->coef == 0)
    {
    dPtr = addLinkBasedPoly(aPtr->nextTermPtr, bPtr->nextTermPtr);
    }
    else
    {
    dPtr = new linkedPolynomialTerm;
    dPtr->expo = aPtr->expo;
    dPtr->coef = aPtr->coef + bPtr->coef;
    dPtr->nextTermPtr = addLinkBasedPoly(aPtr->nextTermPtr, bPtr-
    >nextTermPtr);
    }
    }

    return dPtr;
    }

    You might also like