Re: [OF miscellaneous] Hilbert curve: recursion faster than loop?

[Juan Pablo Carbajal]

> I tried both of your algorithms and have no deeper insight into the Hilbert
> curves, but I think your algorithm computes "more" than you expected. For n
> = 2^2 I get using [1] 16 (x,y) coordinates and using [2] 256 complex
> coordinates. Plotting both images shows me that [2] created a much higher
> order Hilbert curve.

Yes, one algorithm takes the size of the matrix the other just the order
for the recursive one you need to pass 2^n, for the non-recursive ones just n.