4_Poly_mul.c

#include <stdio.h>
#include <stdlib.h>

#define SIZE 5

int count;

struct node
{
    int co, po;
    struct node *addr;
};

typedef struct node *NODE;

NODE insertend(NODE start, int co, int po)
{
    NODE temp, cur;
    temp = (NODE)malloc(sizeof(struct node));
    temp->co = co;
    temp->po = po;
    temp->addr = NULL;
    
    if (start == NULL)
        return temp;
    
    cur = start;
    
    while (cur->addr != NULL)
        cur = cur->addr;
    
    cur->addr = temp;
    return start;
}

void display(NODE start)
{
    NODE temp;
    
    if (start == NULL)
        printf("\n Polynomial Empty");
    else
    {
        temp = start;
        
        while (temp->addr != NULL)
        {
            printf("%dx^%d+", temp->co, temp->po);
            temp = temp->addr;
        }
        
        printf("%dx^%d\n", temp->co, temp->po);
    }
}

NODE addterm(NODE res, int co, int po)
{
    NODE temp, cur;
    temp = (NODE)malloc(sizeof(struct node));
    temp->co = co;
    temp->po = po;
    temp->addr = NULL;
    
    if (res == NULL)
        return temp;
    
    cur = res;
    
    while (cur != NULL)
    {
        if (cur->po == po)
        {
            cur->co = cur->co + co;
            return res;
        }
        
        cur = cur->addr;
    }
    
    if (cur == NULL)
        res = insertend(res, co, po);
    
    return res;
}

NODE multiply(NODE poly1, NODE poly2)
{
    NODE p1, p2, res = NULL;
    
    for (p1 = poly1; p1 != NULL; p1 = p1->addr)
        for (p2 = poly2; p2 != NULL; p2 = p2->addr)
            res = addterm(res, p1->co * p2->co, p1->po + p2->po);
    
    return res;
}

int main()
{
    NODE poly1 = NULL, poly2 = NULL, poly;
    int co, po;
    int i, n, m;
    
    printf("\nRead no of terms of first polynomial:");
    scanf("%d", &n);
    
    for (i = 1; i <= n; i++)
    {
        printf("\n Read CO and PO of %d term : ", i);
        scanf("%d%d", &co, &po);
        poly1 = insertend(poly1, co, po);
    }
    
    printf("\n First polynomial is\n");
    display(poly1);
    
    printf("\nRead no of terms of second polynomial:");
    scanf("%d", &m);
    
    for (i = 1; i <= m; i++)
    {
        printf("\n Read CO and PO of %d term : ", i);
        scanf("%d%d", &co, &po);
        poly2 = insertend(poly2, co, po);
    }
    
    printf("\n Second polynomial is\n");
    display(poly2);
    
    poly = multiply(poly1, poly2);
    
    printf("\n Resultant polynomial is\n");
    display(poly);
    
    return 0;
}