Re^5: Hamming Distance Between 2 Strings - Fast(est) Way? (Ah! But!)

Of course you are right, nothing is deleted without /d.

However, the "count the stars" mode does seem to be consistantly around 10% quicker?

$s = "\0\1" x 10000;;

cmpthese -1, { 
    A=> q[ $n1 = $s =~ tr[\0][\0] ], 
    B=> q[ $n2 = $s =~ tr[\0][]c  ] 
}; 


     Rate   B   A
B 23522/s  -- -9%
A 25935/s 10%  --

print "$n1 : $n2";;
10000 : 10000
[download]

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

Lingua non convalesco, consenesco et abolesco. -- Rule 1 has a caveat! -- Who broke the cabal?

"Science is about questioning the status quo. Questioning authority".

The "good enough" maybe good enough for the now, and perfection maybe unobtainable, but that should not preclude us from striving for perfection, when time, circumstance or desire allow.

Comment on Re^5: Hamming Distance Between 2 Strings - Fast(est) Way? (Ah! But!) Download Code