dsa-practice/plo.c at main · alanaj77/dsa-practice · 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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
#include<stdio.h>

#define MAX 50

typedef struct{

int coeff;

int val;

}poly ;

poly a[MAX];

int avail = 0;

int add_term(int coeff ,int val){

if(avail>MAX){

printf("Size is larger than specified\n");

  return 0;

}

else{

a[avail].coeff = coeff;

    a[avail].val = val;

    avail++;

}

}

void input_terms(int *start ,int *finish){

int n;

printf("Enter the limit of terms\n ");

scanf("%d",&n);

*start = avail;

printf("Enter the coefficient and value\n");

int coeff,val;

for(int i = 0; i<n;i++){

scanf("%d%d",&coeff,&val);

  add_term(coeff,val);

}

*finish = avail - 1;

}

void print_terms(int start,int finish){

for(int i = start ; i<=finish; i++){

  printf("%dx^%d\t",a[i].coeff,a[i].val);

  if(i<finish)

    printf("+\t");

 }

}

int compare(int x, int y){

if(x>y){

return 2;

}

else if(y>x)

return 1;

else

return 0;

}

void poly_sum(int starta, int startb,int finisha,int finishb,int *finishs,int *starts){

int i=starta,j=startb,s;

*starts = avail;

while(i<=finisha && j<= finishb){

switch (compare(a[i].val,a[j].val))

  {

  case 0:

     s = a[i].coeff + a[j].coeff;
    if(s!=0)
      add_term(s,a[i].val);

     i++;

     j++;

     break;

  case 2:

      add_term(a[i].coeff,a[i].val);

      i++;

      break;

  case 1:

     add_term(a[j].coeff,a[j].val);

     j++;

     break;


  default:

     printf("not recognised");

     break;

  }

}

while (i<=finisha)

{

add_term(a[i].coeff,a[i].val);

  i++;

}

while (j<=finishb)

{

add_term(a[j].coeff,a[j].val);

  j++;

}

*finishs = avail - 1;

}

int main(){

int starta=0 ,finisha=0,startb=0,finishb=0,startd,finishd;

input_terms(&starta,&finisha);

input_terms(&startb,&finishb);

print_terms(starta,finisha);

printf("\n");

print_terms(startb,finishb);

poly_sum(starta,startb,finisha,finishb,&finishd,&startd);

printf("\n");

print_terms(startd,finishd);

return 0;

}