From de716bbb952e2060aff03d1ebfefcf9a1b711984 Mon Sep 17 00:00:00 2001
From: Manoj HV <hvmanoj2@gmail.com>
Date: Mon, 8 Dec 2025 20:14:05 +0530
Subject: [PATCH] polynomial addition

---
 a.out        | Bin 0 -> 16424 bytes
 polynomial.c | 148 +++++++++++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 148 insertions(+)
 create mode 100755 a.out
 create mode 100644 polynomial.c

diff --git a/a.out b/a.out
new file mode 100755
index 0000000000000000000000000000000000000000..8e57379fc0ce334e72cd6fec66ce670c3993f002
GIT binary patch
literal 16424
zcmeHOe{fvIecwCjurM}v2B`*<;%6GSHb#eR%Rd>1ljLWg8w<-uYJe1;Pr5tnf^?_e
zy$ceJjTn)RZw@6Y!vNEy87G|%blPS-uA6ZRZDeqaJaJo@0ip~pqhU-&id7<Gm#ScV
z{d{-#dwTaOB{b8S{&PF??z`X5_s4$sySsP$-o1Uo+`Yr=@dz#z;tN7@OB52)g3isX
zAw)=Q7K`z@T-+|M16+wKq{VJJ=2ZfwRa&nCl<aPy${h4_3KmQ`LZW0hUm0GYBuqs>
z@nq+ts^;DF{p*z;Q<fLoGn8DoXr+#ysnd>fGgPbWhPIW`e$I;w3NjrR!DM$t+a1w%
zOs6Rz6sDX{$_ZVYbv$lbM@A@2-FBVY&P}%~Gr^SFpmP8FcJw!CuSMJSuTXy6v{k`^
zDYv&5c9fUTT6mcE>GtLuhaNo+Om%w2-Cc?HjrDhTMQghf$!u?J@8*rQ8|#CaRB)XP
zf#Nc7(eUlOuT8+sFkw24!rQNS_D8a6Ehqi&XV)w}+qn73p_`^Q6`tMtQPoTL=Shd+
zCL7YBLjH7!lBfC&xJXCl!}BEJUcwgPIv4ww?kykYdD)Pxq>$jI5=1f2ff#e()XrS`
z)b?EX_IdDQzztmP@<jl1`B^#-{?I)5N#F)9ci8~o4mSush--;hCXA30@_G<GSvw;v
zD`Q7G9<@3;AGP9<M3;#5CTyUX6dfc=+g5iZkrWv_8cU}k=;)1D@kBDxm3TZRdeVuc
z9S54oq&l{2u`(TzWL(4_ODF7@AQv=^Hj16QcQrOy>w=q#wfbUhU2sFOzP?^qyIPwq
zG!;9L$k?%TYjaaqDj92yw0FhO%z^GyQb%Pe)j1W>Q7`6A1->ULKz;ZmN}n{JDn$g8
z*Ui#IVlmC`M>SS0`AU)1e0Es^-<TER3C$n>)8{ZHydn>t3V+{mUdQ$C$qV}XjPWBH
zuL?;s!8r3{_bQy`n@3gU=ePrRu8#=^F4u>)nReg{9e!pUIISTrJTGW{)4JmFlGdl6
z8D8roJL<q`9dkM1!1=45WWx?z|71y%5eLq>Ai<~u*FRNKzx+|oKsf{D43sla&OkW>
z<qZ69GjQ2|`^Vvdsj6_^_p`f&2!DOp_7+CN1E;E9ldcLI(tryqZG8HdhXm<&l4SC|
zLZJ{Jl00q9Cf}IlX+t*o>MTzirO9KnJZ+FBzc<U%#%S`HB41ef2wIE#m*ZxF{1;YU
z!*<=tf8^pnaPdEP@$b6$w@di7|Gq1C?vZfrz3{+=>6TV=?eN+&;lXXk5N4s~@1S}m
z9`rAN3PB=4gWG-vBs}PQgUFT{y9TLyj_OF=^@VZ&@_y2LO;hOqmDJzxJtC{Gg>%#4
zlONn0J~>kn_M8r%yJlCzK}<WSDvYasvOV>`f7?NbMRrYFcwk#2Rl~XW?M31IwjE$5
z&Ri=LCZfpRX<r+7&%>}Swomqxk3mS4HrVA3Ud?4^^5)fh%$b7=PC!z)SgqLXf)f<_
zMc)Y;(1%}R6U>jmW&aZMYVP1n-goC(AqHkT4%H&;ckz@WoICjsE1>^RWQ4pN!+k?I
z_xi*$2<u0LP4uFc_kD;*58)TWgVjF<Mv5n4eAyo`uflhwH}5+Kg~1k2u4Y7QF4CGc
z--2e|oXJ%#89GypDtB-ymz~I)Q#o^b@)fwuo6`fso}77Q@;izvY3)noquQG{uMo_x
zeIbG?JzHKq*a`a*ixm)s^OfFk&P2YXjLm9%G9u}!p8Ip@E~$TA7;(Cqsd-Dv%o&mm
zm{&ZI-(ybrzwrl1|A09Sewz5FH-jG<DoK5v>S(U*Laupycg`H!oogP=*Zc*o*1S2E
z3rw~l%X#xcN${O$P<D5!q`P|wuJq*I#sK}|Q?xzf@jvxbq>C!wTm(l0GX?v4Oy!-E
z*JKt;-7aCb66SRHK3b#P{xt4S4o{pS$L0l(9u*luanyeTRgC%~j6|vHV@gozz3hMB
zq?~SX|1XFALG$Y43%O>m#CVtVv!7a~VZEADjqj9=PkAVSi(hc7?`8GUv}`08X;CgJ
zwTmHGV^p5_B0{~#9QS|Yc}(Ps+uS}sy;Fx!>hnE<i$0HDrJPJ*pvmQ-m&r|O|9`-4
zN>lr-5;qCy<^tSMM2B9^`)F+pwiGZGMsoqj^1z~PiDLS$T!mqzDZF<0b@LSJwDdME
zB<yv$+$VncaiI_%G*5(cry*)`ioP#JzD)|7NP&Ib93>|gThJgaH?rB|wE2p(X*&v+
zBg*Awr})bd=i83v%@LjL=RTp#jG{{?wwR+|dnxZ5!6X})z)Bv=`(8mkXP!qRALF*S
z7_(0{V!omp_@-0z@qbZwe4i+6;$^UN#eB0fs2@n1w&RHTtaAC3)8&g0=i83w&9ge@
z_t3nG`4t^=HOD+oYx4AuC`S`}(Y1UVkn?iEHG)NC-_?<=P=WrVv!z-`w112Ym(2BN
zF_dzyOSriB`T%1^ReG>W&Rq6CG!hT{4~^vB21yR1y+?He^1Jx#3_>zbAiW6uU^T>T
z&i4Nn;@QFQKi!A#Bj{{!>g1%0^Eq?$Vy`>IOTRZ~h;IYt5Z^$EqZH!kY=|ROYHVeQ
ztEK-@%x@Xr-)ou7=;C60BtO)T*!C&;#2f!f1AT$i^1iR%Nz(?s$CWcDKu>{A@22nZ
z{K1KQ^LW1Pd_Fsdb<~_Yxhpq=@594#PWc{mw)f|7nm31Y=9|>lH%o@Y$9<J>aX5bQ
zyR&_L2Ynr*zK+fI^*kQ;&^(rX-6s8?+G4&b`+7#pWM5Z6HekMqg+X%J*SL~T{QRRr
zK`!2KzHKHNUQ;bsx$T?yHwezq&W(P%<-V@ClOvzyQqDj*1LX{qGf>We%791zyV#ma
z8Qqa&pMk%Zx-&*1Y1o}HqbJqXmrQjhB3;-m$zmp<U?j8M?I5Z6ta?jP)o9pih?P;N
zzH%B*rHuw-RYxiok0&}3v7~LpdV5kyR94?bO*Y*3ppi=Bf3B^f;ma$d50js`^0e@?
zG~5USU6lH4yN#c*-A3K+!rISTguCa#b@ARu5Vf(!5DOhbif&&llkKvNRSgg}t_I+_
zt>PZ~uNxaIapZ$S;V@|6mxaPnPy=)Xv>&twG%;N$jDvm~l>Q7`cd1Y?K$m`4D1<=w
zUMUpz)3ySI{%fY<d3>Mn^aeb)Em}}D1R3G<A8-|XVxuC&_5}eVpT|{?D}WfNEpcOD
z$BnoAzW;{Ds`|yf%eLIP{_}SbO!j|>>jCIVLjq9<w{f)q-w(=#+Ikw-lW1=}f#!{Y
zKk+s#zV0gs2rS9}2G_HY(|^!Kxpz=1ko+vJh3ND9CGzt{`4sSfg?uYLcVhn)YrUjE
z_H<i2i5yi{I^~~Ks0e_SOF0AO43sla&OkW><qVWFP|iR(1OHDM;P>SCy*Ry{m+$6L
zNQ*cwz4>0O`LSD7MU&$DceiOd?X{^aQ$+B4c(gyJ!t(#PR!9+lRKMKjBL*d)EBsE~
zn3nT>;X6uAzMD$bTQpyzDHClbhV=Vvv}LC<q)73;1rIu9q4z+k)M<e62Xr7D_n1<X
z_fb^k_HWlX>){c+>>u(fA^f8w`6}%X&%0SJEpb~R`6=ChJfD|5_d~n?KO_8}x7%Tz
z9`BH*Et>Avv`5o^P2Kjtj;{(Sjh#(RTa8t1?b)QAHP)^Vt`FALZp=z{-Jx~$!Mgg@
z8vfNDY2H?fO9i(U-RIJ~rcdhx8d~9I(7E(!{JeN8wNAe$s?~*|@%=8G?lDQ9*AMIO
zLdApGzbd2<URU&%wMYC`aXl!h5MM)u{P22Y{IJxoDXuTZUqofD_~+}_ap?zl&A-DQ
zX6amhUX}Vwg?oPdM4H_!_&s{|@~+gsrMS)*zk<qK?^`cHLT*BTCv`sMy*hMn1#Ymh
zgZ`Ps@of`wfT(Veeo8Uob^s5ETSXvLDr=Vd0r5E<lzavNl~%&NO9X$fvDHKK_|MLR
zAJ+blY5(#W0-QYqoZkQ5-=sX#qX8-}0H-+J{rXGbhSVtiI8J`Nw+dcAEIkRF^7%YX
z02KLb0`xTL(+C)Zsxuoz-;($;5eg9pv0fkV01qI}P93L`3h^D_<R8vtk<W5a8`t_q
zNa6fBrS;G0FJ$>F1j0)aXRTSf&`bXRXSr=2JP4ff5D1mpP``~*NOG;f@0bHm0l&$M
zUpd$JSQhx4@9W>+k+#<cQ+N$N(w?yF$N>Q$V`t;>V27A}W!|#8tqyu=o?h;crmO>9
zsrE>h6}408j1|fDijGuwPgl&2MT2#7YtZ}s2`iFLNBS&0u}t@gcskM@v!dDV?mn0}
zI18F~iR$cwR77Q2JN7j+o0fUsb_*};Z-4N<hUQ&OfN|)<GQ(OL-o8&*J9qDCY}jq>
z*|Fn(v(;*CXxweW!hH@Q#77BmRG?{3b4$ZM^H&}jpfe6d8#-!W#i9{AA|f_UJ#-4$
zQ?ycg2BK(CuMapB0rHSZ;Y<YeQbfK=2PTkYcvPnnz?2?Qu%eli)fq`faeSdC5{)9*
zJy4A%l2$eoiwgPJ7C|K;vDz~k?M5ECC_PnCjA4^JqETciBz54T1hOm~o#4FFnTk0N
zN|YYwD0M(1tB-w@2t+W`*KJ4ILG84nom|6dkXX7$1d}N{7Cey527A(}o><!Mb3pCc
z1kM^Iq8e&w+*M0+S*mwNGMyqA?MtEwMeVebd^MKNBvQ!|#)2#z>xz(puJv@;A}Avd
zq8dDq0!x)ltV0CtST9(b+|W+Rc@T_s>gn7Wg*WDu4>hlq1=rD3q&op;${a%`f>==9
zSSNF=@!tfZeJsAJ@SCiP``jS!W3^c7a-Ass%+lVG?dLlmN4ivazo<ANHlpIRcb}7^
z=jYDCzbA~*{=;d{`yZwTD{AVt{}OQgw@+V>vhe<#=_-x${@fjZ1o9hju|4nKnQo@!
zqEL)fWqaO7CxFpU65I3r08`%oLq!(tj#=?XsL|e<?Rh`Vl<!M8e%51p2==sBXP)=#
zOj~qI?)W)?K~yNGY|r-(O!@wS+jsZ>d2QdQ9rFDM(;<zMJ>|@8|6O2|6ZT*Hebc{l
ze4hptS={6QZJ<tjL)$U!(RNI<xY*2#F8d*^z?Ajpvp?#xKcWqo?q@?y*&ov%y6k!1
z!t^apn9H8s(hF72{`0<&Dc=XPzB_+E*7iL9!qA$U_LFl*afKuP88T8~d){v|ZFSgE
z)!ja=52yXu3T43bu3ytW?OSierMHE}`wu?X>W-Irrk7yrci8j&{|mJMQCLrLvpnOU
zLO^qu+vocbKBvs*k!k%=VLKlGzXnEKWP85<AG({gh3HYF_{sK6uY<AEUWBx2oub?h
zJ77EJ=|4cixP2p}Bmr$7W`Q;^G-X2fN7TMnXIQX3ULY+gq)Wv~dG08Q`V47@{d&Uu
sHelL!bNu}MOZUyL5T%3RdP&4#mve4cN!4w_T=wBjN@JPJz{QIH22%|~o&W#<

literal 0
HcmV?d00001

diff --git a/polynomial.c b/polynomial.c
new file mode 100644
index 0000000..95ce4ca
--- /dev/null
+++ b/polynomial.c
@@ -0,0 +1,148 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+#define MAX_TERMS 100
+
+typedef struct {
+    float coef;
+    int expon;
+} polynomial;
+
+polynomial terms[MAX_TERMS];
+int avail = 0;
+
+int COMPARE(int a, int b)
+{
+    if (a < b)
+        return -1;
+    if (a == b)
+        return 0;
+    else
+        return 1;
+}
+
+void attach(float coefficient, int exponent)
+{
+    if (avail >= MAX_TERMS) {
+        fprintf(stderr, "Too many terms in the polynomial\n");
+        exit(1);
+    }
+    terms[avail].coef = coefficient;
+    terms[avail++].expon = exponent;
+}
+
+/* sort terms[start..finish] in DESCENDING order of exponent */
+void sort_poly(int start, int finish)
+{
+    int i, j;
+    polynomial temp;
+    for (i = start; i < finish; i++) {
+        for (j = i + 1; j <= finish; j++) {
+            if (terms[i].expon < terms[j].expon) {
+                temp = terms[i];
+                terms[i] = terms[j];
+                terms[j] = temp;
+            }
+        }
+    }
+}
+
+void padd(int starta, int finisha, int startb, int finishb,
+          int *startd, int *finishd)
+{
+    float coefficient;
+    *startd = avail;
+
+    while (starta <= finisha && startb <= finishb) {
+        switch (COMPARE(terms[starta].expon, terms[startb].expon)) {
+            case -1:
+                attach(terms[startb].coef, terms[startb].expon);
+                startb++;
+                break;
+            case 0:
+                coefficient = terms[starta].coef + terms[startb].coef;
+                if (coefficient) {
+                    attach(coefficient, terms[starta].expon);
+                }
+                starta++;
+                startb++;
+                break;
+            case 1:
+                attach(terms[starta].coef, terms[starta].expon);
+                starta++;
+                break;
+        }
+    }
+
+    for (; starta <= finisha; starta++)
+        attach(terms[starta].coef, terms[starta].expon);
+    for (; startb <= finishb; startb++)
+        attach(terms[startb].coef, terms[startb].expon);
+
+    *finishd = avail - 1;
+}
+
+int main(void)
+{
+    int i, j, ae, be, nA, nB, sa, sb, fa, fb, sc, fc = 0;
+    int *sd, *fd;
+    float ac, bc;
+
+    printf("Enter number of terms in Polynomial A: ");
+    scanf("%d", &nA);
+
+    printf("Enter terms for A (coefficient exponent), in ANY order:\n");
+    for (i = 0; i < nA; i++) {
+        printf("A[%d]: ", i + 1);
+        scanf("%f%d", &ac, &ae);
+        attach(ac, ae);
+    }
+
+    fa = avail - 1;   // A ends here
+
+    sb = avail;
+    printf("\nEnter number of terms in Polynomial B: ");
+    scanf("%d", &nB);
+
+    printf("Enter terms for B (coefficient exponent), in ANY order:\n");
+    for (i = 0; i < nB; i++) {
+        printf("B[%d]: ", i + 1);
+        scanf("%f%d", &bc, &be);
+        attach(bc, be);
+    }
+    fb = avail - 1;   // B ends here
+
+    // sort A and B by exponent so padd works correctly
+    sort_poly(0, fa);
+    sort_poly(sb, fb);
+
+    printf("\n-----------------------------------------\n");
+    printf("Polynomial A: ");
+    for (i = 0; i < nA; i++) {
+        printf("%.2fx^%d", terms[i].coef, terms[i].expon);
+        if (i < nA - 1) printf(" + ");
+    }
+
+    printf("\nPolynomial B: ");
+    for (i = sb; i <= fb; i++) {
+        printf("%.2fx^%d", terms[i].coef, terms[i].expon);
+        if (i < fb) printf(" + ");
+    }
+    printf("\n-----------------------------------------\n");
+
+    sa = 0;
+    sc = avail;
+    sd = &sc;
+    fd = &fc;
+
+    padd(sa, fa, sb, fb, sd, fd);
+
+    printf("Result (A + B): ");
+    for (j = sc; j <= fc; j++) {
+        printf("%.2fx^%d", terms[j].coef, terms[j].expon);
+        if (j < fc) printf(" + ");
+    }
+    printf("\n-----------------------------------------\n");
+
+    return 0;
+}