more useful options | |
PerlMonks |
fizbin's scratchpadby fizbin (Chaplain) |
on Jun 01, 2004 at 17:01 UTC ( [id://358236] : scratchpad . print w/replies, xml ) | Need Help?? |
fizbin's stupid web game A method for finding a polynomial of degree <= n-1 to fit n values given for the integers 1,2,3,... Note that Math::Polynomial has its own version of this in the function "interpolate", which is probably faster. Also note that while polynomial interpolation has its uses, it's generally considered invalid to use it as I do here, since the interpolation is likely to be completely unrelated to the original function outside the bounds of the interpolation points.
Regular expression speed comparison, or a meditation on such I still need to add bleadperl numbers to this, and I may be redoing all my numbers soon enough (I'm getting a spiffier machine), but 5.9.3 was added and, well, it didn't do as well as it should have. Note to self: Remember that Tilly came up with this in a chatterbox golfing session:
What does this code do? It computes the same checksum as BSD's historic "sum" program. It's sum1 on http://ppt.perl.org/commands/sum/sum.theo |
Log In^{?}
Chatterbox^{?}
Other Users^{?}
Others imbibing at the Monastery: (9)
As of 2024-03-01 08:52 GMT
Sections^{?}
Information^{?}
Find Nodes^{?}
Leftovers^{?}
Voting Booth^{?}
My favourite way to spend a leap day ...
Results (28 votes). Check out past polls. |