Wait. This is not about efficiency. I guess it’s more about what our founders used to call flexibility.
I sometimes wrote things like this:
sub nose { my $cuke = shift; 1 if $cuke; return; }
This should work as well:
sub nose { my $cuke = shift; 1 if $cuke; undef; }
And i‘m pretty sure that you are aware that return undef; AKA return; isn’t the same as return 0;. But it may be that I even forgot this issue because of lack of practice.
Code not tested because of vacation. Hence no warranty 🤪. Best regards, Karl
«The Crux of the Biscuit is the Apostrophe»
perl -MCrypt::CBC -E 'say Crypt::CBC->new(-key=>'kgb',-cipher=>"Blowfish")->decrypt_hex($ENV{KARL});'Help
In reply to Re^6: check possible combination of sum using given array
by karlgoethebier
in thread check possible combination of sum using given array
by dideod.yang
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |