This code defines a data structure called `Node` which represents...

December 7, 2023 at 08:41 PM


#include <iostream>
using namespace std;

struct Node {
    int coefficient;
    int exponent;
    Node* next;
};


Node* createTerm(int coef, int exp) {
    Node* term = new Node;
    term->coefficient = coef;
    term->exponent = exp;
    term->next = nullptr;
    return term;
}

Node* addPolynomials(Node* poly1, Node* poly2) {
    Node* result = new Node;
    Node* current = result;

    while (poly1 && poly2) {
        if (poly1->exponent > poly2->exponent) {
            current->next = createTerm(poly1->coefficient, poly1->exponent);
            poly1 = poly1->next;
        } else if (poly1->exponent < poly2->exponent) {
            current->next = createTerm(poly2->coefficient, poly2->exponent);
            poly2 = poly2->next;
        } else {
            int sumCoeff = poly1->coefficient + poly2->coefficient;
            if (sumCoeff != 0) {
                current->next = createTerm(sumCoeff, poly1->exponent);
            }
            poly1 = poly1->next;
            poly2 = poly2->next;
        }

        current = current->next;
    }

    while (poly1) {
        current->next = createTerm(poly1->coefficient, poly1->exponent);
        poly1 = poly1->next;
        current = current->next;
    }

    while (poly2) {
        current->next = createTerm(poly2->coefficient, poly2->exponent);
        poly2 = poly2->next;
        current = current->next;
    }

    return result->next; 
}


void displayPolynomial(Node* poly) {
    while (poly) {
        cout << poly->coefficient << "x^" << poly->exponent;
        poly = poly->next;
        if (poly) {
            cout << " + ";
        }
    }
    cout << endl;
}

int main() {
    Node* poly1 = nullptr;
    Node* poly2 = nullptr;

    int numTerms1, numTerms2;

    cout << "Enter the number of terms in the first polynomial: ";
    cin >> numTerms1;
    cout << "Enter the terms of the first polynomial (coefficient exponent):" << endl;
    for (int i = 0; i < numTerms1; i++) {
        int coef, exp;
        cin >> coef >> exp;
        Node* term = createTerm(coef, exp);
        if (!poly1) {
            poly1 = term;
        } else {
            Node* current = poly1;
            while (current->next) {
                current = current->next;
            }
            current->next = term;
        }
    }

    cout << "Enter the number of terms in the second polynomial: ";
    cin >> numTerms2;
    cout << "Enter the terms of the second polynomial (coefficient exponent):" << endl;
    for (int i = 0; i < numTerms2; i++) {
        int coef, exp;
        cin >> coef >> exp;
        Node* term = createTerm(coef, exp);
        if (!poly2) {
            poly2 = term;
        } else {
            Node* current = poly2;
            while (current->next) {
                current = current->next;
            }
            current->next = term;
        }
    }

    cout << "Polynomial 1: ";
    displayPolynomial(poly1);

    cout << "Polynomial 2: ";
    displayPolynomial(poly2);

    Node* result = addPolynomials(poly1, poly2);

    cout << "Sum of the two polynomials: ";
    displayPolynomial(result);

    return 0;
}

This code defines a data structure called Node which represents a term in a polynomial. Each Node has a coefficient, an exponent, and a pointer to the next term in the polynomial.

The code also includes a function createTerm that creates a new Node with the given coefficient and exponent.

There is another function addPolynomials that takes two polynomial Node pointers as input and returns a new polynomial Node that represents the sum of the two input polynomials.

The displayPolynomial function is used to display the polynomial in a readable format.

In the main function, the user is prompted to enter the number of terms and coefficients/exponents for two polynomials. The input is then used to create the corresponding polynomial Node structures.

Finally, the two polynomials are displayed, their sum is calculated using the addPolynomials function, and the result is displayed.

Generate your own explanations

Download our vscode extension

Read other generated explanations

Built by @thebuilderjr