Notes

#include <stdio.h>
struct poly{
int coeff;
int expo;
};

struct poly a[10],b[10],c[10];

int readPoly(struct poly []);
int addPoly(struct poly[],struct poly [],int,int,struct poly[]);
void displayPoly(struct poly[], int terms);

int main(){
int t1,t2,t3;

t1=readPoly(a);
printf(" nFirst polynomial:");
displayPoly(a,t1);

t2=readPoly(b);
printf(" nFirst polynomial:");
displayPoly(b,t2);

t3=addPoly(a,b,t1,t2,c);
printf("nn Addition: ");
displayPoly(c,t3);

return 0;
}

int readPoly(struct poly p[10]){
int t1,i;
printf("nn Enter the total number of terms in the polynomial:");
scanf("%d",&t1);
printf("n Enter the COEFFICIENT and EXPONENT in DESCENDING ORDERn");
for(i=0;i<t1;i++){
printf(" Enter the Coefficient(%d): ",i+1);
scanf("%d",&p[i].coeff);
printf(" Enter the Exponent(%d): ",i+1);
scanf("%d",&p[i].expo);
}
return(t1);
}

int addPoly(struct poly p1[10],struct poly p2[10],int t1,int t2,struct poly p3[10]){
int i=0,j=0,k=0;
while(i<t1 && j<t2){
if(p1[i].expo == p2[j].expo){
p3[k].coeff=p1[i].coeff + p2[j].coeff;
i++;j++;k++;
}
else if(p1[i].expo > p2[j].expo){
p3[k].coeff=p1[i].coeff;
p3[k].expo=p1[i].expo;
i++;k++;
}
else{
p3[k].coeff=p2[j].coeff;
p3[k].expo=p2[j].expo;
j++;k++;
}
}
while(i<t1){
p3[k].coeff=p1[i].coeff;
p3[k].expo=p1[i].expo;
i++;k++;
}
while(j<t2){
p3[k].coeff=p2[j].coeff;
p3[k].expo=p2[j].expo;
j++;k++;
}
return(k);
}

void displayPoly(struct poly p[10],int term){
int k;
for(k=0;k<term-1;k++)
printf("%d(x^%d)+",p[k].coeff,p[k].expo);
printf("%d(x^%d)+",p[term-1].coeff,p[term-1].expo);
}