Fast Fourier transform: Difference between revisions
Content added Content deleted
m (→Python: Recursive: This version is faster and more similar to the C++ implementation) |
|||
| Line 1,689: | Line 1,689: | ||
<lang Scala>def _fft(cSeq: Seq[Complex], direction: Complex, scalar: Int): Seq[Complex] = { |
<lang Scala>def _fft(cSeq: Seq[Complex], direction: Complex, scalar: Int): Seq[Complex] = { |
||
if (cSeq.length == 1) { |
if (cSeq.length == 1) { |
||
cSeq |
return cSeq |
||
} |
} |
||
val n = cSeq.length |
val n = cSeq.length |
||