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

[siko1056]

jbect wrote
> 
> Juan Pablo Carbajal wrote
>> for i=1:100; tic; hilbert_curve_nr(9,true); t(i)=toc; end; [mean(t)
>> std(t)]
>> ans =
>> 
>>      0.0088032   0.0024393
>> 
>> for i=1:100; tic; hilbert_curve_nr(9,false); t(i)=toc; end; [mean(t)
>> std(t)]
>> ans =
>> 
>>      0.0065030   0.0018694
>> 
>> for i=1:100; tic; hilbert_curve(2^9); t(i)=toc; end; [mean(t) std(t)]
>> ans =
>> 
>>      1.9476e-03   8.0688e-04
> Octave 4.0.1
> 
> 7.34 ms [0.11 ms]
> 4.73 ms [0.06 ms]
> 1.27 ms [0.03 ms]
> 
> Octave 4.3.0+
> 
> 7.61 ms [0.16 ms]
> 4.82 ms [0.05 ms]
> 1.42 ms [0.03 ms]
> 
> Matlab R2016b
> 
> 8.65 ms [0.58 ms]
> 2.98 ms [0.10 ms]
> 1.30 ms [0.08 ms]

Same figures here except for nuances using Octave 4.3.0+ and Matlab R2017a
as Juan and jbect got.



--
View this message in context: 
http://octave.1599824.n4.nabble.com/OF-miscellaneous-Hilbert-curve-recursion-faster-than-loop-tp4684339p4684363.html
Sent from the Octave - General mailing list archive at Nabble.com.