Much nicer. Falling over to using the approximation only when needed makes a lot of sense.
BTW: You have a couple of artifacts left from the earlier caching scheme
my $max_arr; my @ln_fact; ... BEGIN { $max_arr = 10000; $#ln_fact = $max_arr - 1;
In reply to Re^6: Algorithm for cancelling common factors between two lists of multiplicands
by BrowserUk
in thread Algorithm for cancelling common factors between two lists of multiplicands
by BrowserUk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |