Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl: the Markov chain saw

Re: Re: Puzzle: need a more general algorithm

by Anonymous Monk
on Jul 10, 2002 at 12:35 UTC ( #180735=note: print w/replies, xml ) Need Help??

in reply to Re: Puzzle: need a more general algorithm
in thread Puzzle: need a more general algorithm

Very good. Pre-memoization you are exponential. With memoization your memory usage scales like O(n**3), and your performance is O(n**4). If you passed the array by reference, and added 2 indices, you would drop a factor of n off of both.

By contrast the efficient algorithm is sub-exponential pre-memoization, and is sub-quadratic after.

Which shows that good algorithms are a big win, but being straightforward, and then applying well-known speedups to that, can still result in a usable algorithm.

  • Comment on Re: Re: Puzzle: need a more general algorithm

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://180735]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (8)
As of 2018-03-24 11:11 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (298 votes). Check out past polls.