Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re: optimizing the miller-rabin algorithm

by ForgotPasswordAgain (Priest)
on May 16, 2006 at 10:54 UTC ( [id://549710]=note: print w/replies, xml ) Need Help??


in reply to optimizing the miller-rabin algorithm

For any kind of optimization, you need to profile the code, for example with Devel::DProf.
  • Comment on Re: optimizing the miller-rabin algorithm

Replies are listed 'Best First'.
Re^2: optimizing the miller-rabin algorithm
by Limbic~Region (Chancellor) on May 16, 2006 at 16:39 UTC
    ForgotPasswordAgain,
    This advice reeks of cargo-cult mantra chanting. If I was doing a linear search on a sorted list, would you need to profile in order to know that a binary search would be faster? Pure algorithm analysis doesn't require machine profiling. Implementation specific details may distort things where it is warranted. Profiling is always a good rule of thumb, but it isn't always necessary. Especially when the algorithm being implemented is well known and studied. Sometimes it is just a matter of discovering you have implemented it incorrectly.

    Cheers - L~R

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://549710]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others having a coffee break in the Monastery: (5)
As of 2024-04-19 04:04 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found