Fast Fourier transform: Difference between revisions
Content added Content deleted
(Updated to work with version 1.4 of Nim. Removed a warning. Updated results.) |
|||
| Line 2,052: | Line 2,052: | ||
let halfn = n div 2 |
let halfn = n div 2 |
||
for k in 0 .. |
for k in 0 ..< halfn: |
||
let a = exp(complex(0.0, -2 * Pi* float(k) / float(n))) * odd[k] |
let a = exp(complex(0.0, -2 * Pi* float(k) / float(n))) * odd[k] |
||
result[k] = even[k] + a |
result[k] = even[k] + a |
||
| Line 2,062: | Line 2,062: | ||
<pre>4.000 |
<pre>4.000 |
||
2.613 |
2.613 |
||
0.000 |
|||
1.082 |
1.082 |
||
0.000 |
|||
1.082 |
1.082 |
||
0.000 |
|||
2.613</pre> |
2.613</pre> |
||