Problems? Is your data what you think it is? | |
PerlMonks |
Re^12: Faster Luhn Check Digit Calculation?by LanX (Saint) |
on Dec 03, 2018 at 00:22 UTC ( [id://1226643]=note: print w/replies, xml ) | Need Help?? |
> Just replicating the original module, including a fairly straight port to C This doesn't mean you have to ignore a fast algorithm for the proper task. Mapping B => b0=11 is most likely producing the same effect like mapping B to two digits b1,b2 < 10 with b1 for odd and b2 for even positions. From there on you can still use the fast algorithm. Otherwise I don't understand the point of the whole thread and am quizte happy I didn't try to waste time on coding an even faster solution.
Cheers Rolf
In Section
Seekers of Perl Wisdom
|
|