c code to add polynomials using linked list
write a c code to add polynomials using linked list
Write a program to add two polynomials with a single variable. Write a function to create & display the polynomial using a linked list and write a new function for addition operations.
Code
#include <stdio.h>
#include <malloc.h>
struct Node
{
int coeff;
int pow;
struct Node *next;
};
void create_node(int x, int y, struct Node **temp)
{
struct Node *r, *z;
z = *temp;
if (z == NULL)
{
r = (struct Node *)malloc(sizeof(struct Node));
r->coeff = x;
r->pow = y;
*temp = r;
r->next = (struct Node *)malloc(sizeof(struct Node));
r = r->next;
r->next = NULL;
}
else
{
r->coeff = x;
r->pow = y;
r->next = (struct Node *)malloc(sizeof(struct Node));
r = r->next;
r->next = NULL;
}
}
void polyadd(struct Node *poly1, struct Node *poly2,
struct Node *poly)
{
while (poly1->next && poly2->next)
{
if (poly1->pow > poly2->pow)
{
poly->pow = poly1->pow;
poly->coeff = poly1->coeff;
poly1 = poly1->next;
}
else if (poly1->pow < poly2->pow)
{
poly->pow = poly2->pow;
poly->coeff = poly2->coeff;
poly2 = poly2->next;
}
else
{
poly->pow = poly1->pow;
poly->coeff = poly1->coeff + poly2->coeff;
poly1 = poly1->next;
poly2 = poly2->next;
}
poly->next = (struct Node *)malloc(sizeof(struct Node));
poly = poly->next;
poly->next = NULL;
}
while (poly1->next || poly2->next)
{
if (poly1->next)
{
poly->pow = poly1->pow;
poly->coeff = poly1->coeff;
poly1 = poly1->next;
}
if (poly2->next)
{
poly->pow = poly2->pow;
poly->coeff = poly2->coeff;
poly2 = poly2->next;
}
poly->next = (struct Node *)malloc(sizeof(struct Node));
poly = poly->next;
poly->next = NULL;
}
}
void show(struct Node *node)
{
while (node->next != NULL)
{
printf("%dx^%d", node->coeff, node->pow);
node = node->next;
if (node->coeff >= 0)
{
if (node->next != NULL)
printf("+");
}
}
}
int main()
{
struct Node *poly1 = NULL, *poly2 = NULL, *poly = NULL;
int n, x, y;
printf("enter the 1 polyinomial,with higest coficient first\n");
do
{
printf("enter the cofficient : ");
scanf("%d", &x);
printf("enter the power : ");
scanf("%d", &y);
create_node(x, y, &poly1);
printf("want to enter more ? 1 for yes or 0 for no : ");
scanf("%d", &n);
} while (n);
printf("enter the 2 polyinomial,with higest coficient first\n");
do
{
printf("enter the cofficient : ");
scanf("%d", &x);
printf("enter the power : ");
scanf("%d", &y);
create_node(x, y, &poly2);
printf("want to enter more ? 1 for yes or 0 for no : ");
scanf("%d", &n);
} while (n);
printf("1st polynomial: ");
show(poly1);
printf("\n2nd polynomial: ");
show(poly2);
poly = (struct Node *)malloc(sizeof(struct Node));
polyadd(poly1, poly2, poly);
printf("\nAdded polynomial: ");
show(poly);
return 0;
}