Fast Fourier transform: Difference between revisions
m
→Recursive
(→{{header|Raku}}: mark as in need for improvement) |
m (→Recursive) |
||
| (3 intermediate revisions by 3 users not shown) | |||
Line 229:
FOR I% = 0 TO 7
READ in{(I%)}.r#
out{(I%)}.r# = in{(I%)}.r#
PRINT in{(I%)}.r# "," in{(I%)}.i#
NEXT
Line 2,708 ⟶ 2,709:
ucomplex;
{$WARN 6058 off : Call to subroutine "$1" marked as inline is not inlined}
(*) Use for variants and ucomplex (*)
Line 4,693 ⟶ 4,696:
1 2.414213562</pre>
=={{header|V (Vlang)}}==
{{trans|Go}}
<syntaxhighlight lang="v (vlang)">import math.complex
import math
fn ditfft2(x []f64, mut y []Complex, n int, s int) {
Line 4,740 ⟶ 4,743:
{{libheader|Wren-complex}}
{{libheader|Wren-fmt}}
<syntaxhighlight lang="
import "./fmt" for Fmt
var ditfft2 // recursive
| |||