Fast Fourier transform: Difference between revisions
Content added Content deleted
(Updated to work with version 1.4 of Nim. Removed a warning. Updated results.) |
m (→{{header|Nim}}) |
||
Line 2,053: | Line 2,053: | ||
for k in 0 ..< halfn: |
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 |
||
result[k + halfn] = even[k] - a |
result[k + halfn] = even[k] - a |