Fast Fourier transform: Difference between revisions
→Recursive
m (→Recursive) |
|||
Line 2,736:
O : table ;
Odds : table ;
T : table ;▼
BEGIN
Line 2,751 ⟶ 2,750:
SetLength ( E, halfN ) ;
SetLength ( O, halfN ) ;
Split ( L, E, O ) ;▼
SetLength ( Even, halfN ) ;
Even := FFT ( E ) ;▼
SetLength ( E , 0 ) ;▼
SetLength ( Odds, halfN ) ;
▲ Split ( L, E, O ) ;
▲ Even := FFT ( E ) ;
Odds := FFT ( O ) ;
▲ SetLength ( E , 0 ) ;
SetLength ( O , 0 ) ;
SetLength (
FOR k := 0 to halfN - 1 DO
BEGIN
T
END ;
SetLength ( Even, 0 ) ;
SetLength ( Odds, 0 ) ;
FFT :=
▲ SetLength ( R, 0 ) ;
END ;
Line 2,833 ⟶ 2,828:
</lang>
JPD 2021/12/
=={{header|Perl}}==
| |||