<div>
<div class="content wysiwyg-content">
I need working code in &nbsp;C to multiply two polinomials using Fast Fourrier Transform (FFT) in recursive way.<br />
<br />
Ex.<br />
I have two arrays of n elements:<br />
int *poli1 = { 2, 3, 1 } /* 2x^2 + 3x + 1 */<br />
int *poli2 = { 3, 4, 8 } /* 3x^2 + 4x + 8 */<br />
<br />
I need an array R of results: &nbsp;R = { 6, 17, 31, 28, 8 } &nbsp;/* 6x^4 + 17x^3 + 31x^2 + 28x + 8 */<br />
<br />
with FFT the execution time is something like O(n^1,58)<br />
<br />
This is URGENT!<br />
Please Help!!!
</div>
</div>


I need working code in  C to multiply two polinomials using Fast Fourrier Transform (FFT) in recursive way.

Ex.
I have two arrays of n elements:
int *poli1 = { 2, 3, 1 } /* 2x^2 + 3x + 1 */
int *poli2 = { 3, 4, 8 } /* 3x^2 + 4x + 8 */

I need an array R of results:  R = { 6, 17, 31, 28, 8 }  /* 6x^4 + 17x^3 + 31x^2 + 28x + 8 */

with FFT the execution time is something like O(n^1,58)

This is URGENT!
Please Help!!!

Polynomial Multiplication with FFT

C is a general-purpose, imperative computer programming language, supporting structured programming, lexical variable scope and recursion, while a static type system prevents many unintended operations. By design, C provides constructs that map efficiently to typical machine instructions, so it has found lasting use in applications that had formerly been coded in assembly language, including operating systems as well as various application software for computers ranging from supercomputers to embedded systems. It is distinct from C++ (which has its roots in C) and C#, and many later languages have borrowed directly or indirectly from C.