task-7.cpp

#include <iostream>
using namespace std;

class PolyNode {
public:
    int coeff;
    int exp;
    PolyNode* next;

    PolyNode(int c, int e) {
        coeff = c;
        exp = e;
        next = nullptr;
    }
};

class Polynomial {
private:
    PolyNode* head;

public:
    Polynomial() {
        head = nullptr;
    }

    void insertTerm(int coeff, int exp) {
        if (coeff == 0) return;

        PolyNode* newNode = new PolyNode(coeff, exp);

        if (!head || head->exp < exp) {
            newNode->next = head;
            head = newNode;
            return;
        }

        PolyNode* temp = head;
        PolyNode* prev = nullptr;

        while (temp && temp->exp > exp) {
            prev = temp;
            temp = temp->next;
        }

        if (temp && temp->exp == exp) {
            temp->coeff += coeff;
            if (temp->coeff == 0) {
                if (prev) prev->next = temp->next;
                else head = temp->next;
                delete temp;
            }
            delete newNode;
            return;
        }

        newNode->next = temp;
        if (prev) prev->next = newNode;
        else head = newNode;
    }

    Polynomial add(Polynomial& other) {
        Polynomial result;

        PolyNode* p1 = head;
        PolyNode* p2 = other.head;

        while (p1 && p2) {
            if (p1->exp > p2->exp) {
                result.insertTerm(p1->coeff, p1->exp);
                p1 = p1->next;
            } else if (p2->exp > p1->exp) {
                result.insertTerm(p2->coeff, p2->exp);
                p2 = p2->next;
            } else {
                result.insertTerm(p1->coeff + p2->coeff, p1->exp);
                p1 = p1->next;
                p2 = p2->next;
            }
        }

        while (p1) {
            result.insertTerm(p1->coeff, p1->exp);
            p1 = p1->next;
        }

        while (p2) {
            result.insertTerm(p2->coeff, p2->exp);
            p2 = p2->next;
        }

        return result;
    }

    void display() {
        PolyNode* temp = head;
        while (temp) {
            cout << temp->coeff << "x^" << temp->exp;
            if (temp->next) cout << " + ";
            temp = temp->next;
        }
        cout << endl;
    }
};

int main() {
    Polynomial P1, P2;

    P1.insertTerm(5, 3);
    P1.insertTerm(2, 2);
    P1.insertTerm(1, 0);

    P2.insertTerm(3, 2);
    P2.insertTerm(4, 1);
    P2.insertTerm(2, 0);

    cout << "P1: ";
    P1.display();

    cout << "P2: ";
    P2.display();

    Polynomial sum = P1.add(P2);

    cout << "Sum: ";
    sum.display();

    return 0;
}