W dniu 28.05.2017 o 20:57, Riccardo (Jack) Lucchetti pisze:
On Sun, 28 May 2017, Marcin Błażejowski wrote:
> W dniu 28.05.2017 o 12:34, Riccardo (Jack) Lucchetti pisze:
>> On Sun, 28 May 2017, Marcin Błażejowski wrote:
>>
>>> Jack,
>>> it's briliant - as usual.
>>>
>>> Thans a lot!!!
>>
>> Thanks. However, it seems that a loop-based version is actually faster
>> (much to my surprise):
> Jack, I don't get it: simpler (I think) version based on loop for/break
> is even faster:
It turns out, there's a huge difference when matrices are smaller (and
besides, memory allocation costs are reduced to the bare minimum. Try
this:
Ok, so do we known the theshold for staying at find_0 approach and
switching to loop-based approach?
Marcin