in reply to Re: Better algorithm than brute-force stack for combinatorial problems? (A::L)
in thread Better algorithm than brute-force stack for combinatorial problems?

Heh, changing the set to 1..20 and the desired sum to 30, I got the following run times:

SecondsAuthor
0tye
10Solo
24kvale
673BrowserUK

Just a quick, cheap benchmark. (:

- tye        

  • Comment on Re^2: Better algorithm than brute-force stack for combinatorial problems? (Benchmarks)

Replies are listed 'Best First'.
Re: Re^2: Better algorithm than brute-force stack for combinatorial problems? (Benchmarks)
by BrowserUk (Patriarch) on May 21, 2004 at 23:07 UTC

    And that's the value of benchmarks :)

    Examine what is said, not who speaks.
    "Efficiency is intelligent laziness." -David Dunham
    "Think for yourself!" - Abigail
[reply]

In Section Seekers of Perl Wisdom