dst_lab/polyadd at main · DIYA-BHATT29/dst_lab · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
void main()
{  int t1.t2.t3;

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

   t2=readPoly(p2):
   printf("\nSecond polynomial:");
   displayPoly(p2,t2);


   t3=addPoly(p1,p2,t1,t2,p3);
   printf("\n\nResultant polynomial after addition:");
   displayPoly(p3,t3);

}

int readPoly(struct poly p[10])

{   int t1'i;


    printf("\nEnter the total number of terms in the polynomial:");
    scanf("%d",&t1);

    printf("\nEnter the COEFFICIENT and EXPONENT in DESCENDING ORDER\n");
    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);
}

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);

}

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;
             p3[k].expo=p1[i].expo;
             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);