すいません、あと i = 0; for (j = 1; j < n - 1; j++) { for (k = n >> 1; k > (i ^= k); k >>= 1); if (j < i) { x0r = ar[j]; x0i = ai[j]; ar[j] = ar[i]; ai[j] = ai[i]; ar[i] = x0r; ai[i] = x0i; } } この計算って Dim i_2 As Integer = 0 For j As Integer = 1 To n - 2 Dim k As Integer = n \ 2 Do i_2 = CInt(i_2 ^ k) If k <= i_2 Then Exit Do ElseIf j < i_2 Then Dim x0r As Double = xr(j) Dim x0i As Double = xi(j) xr(j) = xr(i_2) xi(j) = xi(i_2) xr(i_2) = x0r xi(i_2) = x0i End If k \= 2 Loop Next j これで合っていますか? どうやってもうまく計算できないのですが・・・
- Child Tree -