Databases
StackOverflow2013
Postsdbo
POPolynomial class with 2d array of terms as data member and uses operator + overloading
Body
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POPolynomial class with 2d array of terms as data member and uses operator + overloading
    text
    copied!<p>A polynomial class is implemented, with 2 D array of terms, and number of terms as data members. array rows are coefficients and array columns are exponents. we aim to overload + operator to do addition i.e. add coefficients if exponents are same, else include terms as is.</p> <p>The output is correct partially, last term of output is incorrect..please look into operator + overloading and suggest remedy ! Thanks in advance...</p> <p>see comments for removal of previous flaws.</p> <pre><code>#ifndef POLYNOMIAL_H #define POLYNOMIAL_H #include &lt;iostream&gt; using namespace std; #define MAX 10 class Polynomial { public : Polynomial (); //~Polynomial(){ delete [] terms[MAX]; } (see comments) void enterTerms(); Polynomial operator +(const Polynomial &amp; ); private : int terms[MAX][2]; //define size statically if not using "new" int n; //number of terms }; #endif #include "polynomial.h" Polynomial Polynomial :: operator + ( const Polynomial &amp; p ){ Polynomial temp, sum; temp.n = n + p.n; int common = 0; //first write sum as concatenation of p1 and p2 for ( int i = 0 ; i &lt; n ; i++ ){ temp.terms[i][0] = terms[i][0]; temp.terms[i][1] = terms[i][1]; } //notice j and k for traversing second half of sum, and whole p2 resp for ( int j = n, k = 0; j &lt; n + p.n, k &lt; p.n ; j++, k++ ){ temp.terms[j][0] = p.terms[k][0]; temp.terms[j][1] = p.terms[k][1]; } for ( int l = 0; l &lt; temp.n - 1 ; l++ ){ // 0 to 1 less than length for ( int m = l + 1 ; m &lt; temp.n ; m++ ){ // 1 more than l to length,so that compared pairs are non redundant if( temp.terms[l][1] == temp.terms[m][1] ){ common++; //common terms reduce no. of terms temp.terms[l][0] += temp.terms[m][0]; //coefficients added of exponents same temp.terms[m][0] = 0; } } } sum.n = temp.n - common; for ( int q = 0, r = 0; q &lt; temp.n, r &lt; sum.n; q++, r++){ if ( temp.terms[q][0] == 0 ) continue; else if ( temp.terms[q][0] != 0 ){ sum.terms[r][0] = temp.terms[q][0]; sum.terms[r][1] = temp.terms[q][1]; } } cout &lt;&lt; sum; return sum; } Polynomial :: Polynomial(){ for ( int i = 0; i &lt; MAX; i++ ){ terms[i][0] = 0; terms[i][1] = 0; } } void Polynomial :: enterTerms(){ int num; cout&lt;&lt;"enter number of terms in polynomial\n"; cin &gt;&gt; num; n = num &gt;= 0 ? num : 1; cout &lt;&lt; "enter coefficient followed by exponent for each term in polynomial\n"; for ( int i = 0; i &lt; n ; i++) cin &gt;&gt; terms[i][0] &gt;&gt; terms[i][1] ; } int main(){ Polynomial p1 , p2; p1.enterTerms(); p2.enterTerms(); p1 + p2; system("PAUSE"); return EXIT_SUCCESS; } </code></pre> <p><img src="https://i.stack.imgur.com/h6M4s.jpg" alt="op"></p>
 

Querying!

 
Guidance
An individual column

Larger individual text columns get their own page to allow for proper reading.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload