0% found this document useful (0 votes)
21 views2 pages

Add Two Plynomial Rec

Uploaded by

mithunmp2004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
21 views2 pages

Add Two Plynomial Rec

Uploaded by

mithunmp2004
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 2

#include<iostream.

h>
#include<conio.h>
class poly
{
int order;
int coeff[10];
public:
void initialize();
void getorder();
void create();
void poly3order(poly,poly);
void polyadd(poly,poly);
void display();
};
void poly::initialize()
{
int i;
for(i=0;i<10;i++)
coeff[i]=0;
}
void poly::getorder()
{
cout<<"Highest Order:";
cin>>order;
}
void poly::create()
{
int i;
for(i=order;i>-1;i--)
{
cout<<"exponent:"<<i<<" ";
cout<<"coefficient:";
cin>>coeff[i];
}
}
void poly::poly3order(poly f,poly s)
{
if(f.order==s.order)
order=f.order;
else
if(f.order>s.order)
order=f.order;
else if(s.order>f.order)
order=f.order;
}
void poly::polyadd(poly fp,poly sp)
{
int i;
for(i=order;i>-1;i--)
coeff[i]=fp.coeff[i]+sp.coeff[i];
}
void poly::display()
{
int i;
for(i=order;i>-1;i--)
{
if(i==order)
cout<<coeff[i]<<"x^"<<i<<" ";
else
{
if(coeff[i]>=0)cout<<"+";
cout<<coeff[i]<<"x^"<<i<<" ";
}
}
cout<<endl;
}
int main()
{
clrscr();
poly p1,p2,p3;
cout<<"polynomial1:\n";
p1.initialize();
p1.getorder();
p1.create();
cout<<"polynomial2:\n";
p2.initialize();
p2.getorder();
p2.create();
p3.initialize();
p3.poly3order(p1,p2);
p3.polyadd(p1,p2);
cout<<"first polynomial:";
p1.display();
cout<<"second polynomial:";
p2.display();
cout<<"third polynomial:";
p3.display();
getch();
return 0;
}

You might also like