Thats a taugh problem!!

[TAboy24]

Hey people!
I need writing descending polynom of the form :
(CX^n)+(CX^n-1)+.....+(CX^1)+(C^0)
every part of the polynom(for example CX^n-1 is one part of many) is represented as:
Typedef struct monom {
int coeficient; //(the "C")
int power; //(the "n")
}Monom;

!*!)write a program getting input 2 polynoms and prints the sum polynom and the multiply polynom of these 2 inputs in diferent lines...

comments: coefficient(C) is never 0 and also the output C isnt!
every polynom of the input is actually a line (unknown length) of pairs(coeficient and power)..for example:
2 4 -5 1 0 6 6 4 -8 0 7 3 represents: 8x^4+7x^3-5x-8 !!


Thats really taughmaybe you suceed better then me

[DJMaze]

As replied on many forums to your questions already: What are your attempts so far?

[teknomage1]

don't you just sort by the power?

[Valmont]

It is not really tough once you see what you're really asking for.
Realize that X^k + X^k-1 + X^k-2 | k => 0
is the same as going backwards with k initialized with 0.
That's the first thing.

Second:
The invariant (the property that always remains the same) of
c*X^k == X^m
In normal words: this invariant implies that you only need to create an algorithm that calculates powers - basically!

Good news isn't it?

Let's see if I can create a quick implementation in some pseudo-language.

k=m; //user input
y=1;
WHILE k != 0 DO
  k=k-1;
  y=y-x;
END WHILE

In the WHILE loop, you add code to multiply with some constant which you have entered on the commandline. That's it!

A faster method for large numbers is available in terms of Horner.
I don't know anything about your mathskills with inequalities and summations. If the skills are there, then I can introduce you to it the formal way with easy to understand pseudo code.

Start playing with the pseudo code I gave you. Translate it into C++. Forget about classes and all the fancy stuff for now. See if you can get anything working.