Polynomial Addition and Subtraction Implementation using c program

Data Structures using C Language / Polynomial Addition and Subtraction Implementation using c program

Program

#include <stdio.h>
#include<stdlib.h>
struct Term
{int coeff, exp;};

struct Poly
{int n; struct Term *terms;};

void Build (struct Poly *p)
{
int i;
printf ("Enter Number of terms: ");
scanf ("%d", &p->n);
p->terms = (struct Term *) malloc (p->n * sizeof (struct Term));

printf ("Enter terms:\n");
for (i = 0; i < p->n; i++)
scanf ("%d%d", &p->terms[i].coeff, &p->terms[i].exp);
printf ("\n");
}

void show (struct Poly p)
{
int i;
for (i = 0; i < p.n; i++)
{
printf ("%dx%d", p.terms[i].coeff, p.terms[i].exp);
if (i + 1 < p.n)
 printf (" + ");
}
printf ("\n");
}

struct Poly *add (struct Poly *p1, struct Poly *p2)
{
int i, j, k;
struct Poly *sum;
sum = (struct Poly *) malloc (sizeof (struct Poly));
sum->terms = (struct Term *) malloc ((p1->n + p2->n) * sizeof (struct Term));

i = j = k = 0;
while (i < p1->n && j < p2->n)
{
if (p1->terms[i].exp > p2->terms[j].exp)
 sum->terms[k++] = p1->terms[i++];
else if (p1->terms[i].exp < p2->terms[j].exp)
 sum->terms[k++] = p2->terms[j++];
else
 {
 sum->terms[k].exp = p1->terms[i].exp;
 sum->terms[k++].coeff = p1->terms[i++].coeff + p2->terms[j++].coeff;
 }
}

for (; i < p1->n; i++)
sum->terms[k++] = p1->terms[i];
for (; j < p2->n; j++)
sum->terms[k++] = p2->terms[j];
sum->n = k;
return sum;
}

int main()
{
struct Poly p1, p2, *p3;
printf ("Enter Polynomial 1:\n");Build (&p1);
printf ("Enter Polynomial 2:\n");Build (&p2);

p3 = add (&p1, &p2);printf ("\n");
printf ("Polynomial 1 is: ");show (p1);printf ("\n");
printf ("Polynomial 2 is: ");show (p2);printf ("\n");
printf ("Polynomial 3 is: ");
show (*p3);
return 0;
}

Output

Enter polynomial 1 :
Enter Number of terms: 3
Enter terms: 
4 4
3 2
2 0
Enter polynomial 2 :
Enter Number of terms: 3
Enter terms: 
5 3
9 1
1 0
polynomial 1 : 4*4 + 3*2 + 2*0
polynomial 2 : 5*3 + 9*1 + 1*0
polynomial 2 : 4*4 + 5*3 + 3*2  + 9*1 + 3*0

Home Back