Re^5: Challenge: Number of unique ways to reach target sum

This is an archived low-energy page for bots and other anonmyous visitors. Please sign up if you are a human and want to interact.

Your C takes 72 min on your machine, how long does blokhead's perl version take on the same machine?

Comment on Re^5: Challenge: Number of unique ways to reach target sum

Replies are listed 'Best First'.
Re^6: Challenge: Number of unique ways to reach target sum by Limbic~Region (Chancellor) on Feb 15, 2006 at 13:38 UTC
fergal, I only ran the version that actually iterated (without Memoize) and gave up after about 3 hours. Cheers - L~R	[reply]
Re^7: Challenge: Number of unique ways to reach target sum by fergal (Chaplain) on Feb 15, 2006 at 16:02 UTC
Well, blokhead's memoize version take < 10s so that the easiest thing available as a benchmark and it's takes little effort to run it. I managed to generate all solutions just using Perl in 74 mins on one machine and 2 hours on another. I'd like to be able to compare these results to your 72 mins without having to chew 72 mins of CPU. I just tried it on that machine and killed it after 93 mins. It was compiled with -O2. Have you got a very very fast machine? If so then I think Perl with ugly-memoize beats the C, which is very surprising.	[reply]
Re^8: Challenge: Number of unique ways to reach target sum by Limbic~Region (Chancellor) on Feb 15, 2006 at 16:10 UTC
fergal, I compiled with the following optimizations: `gcc -Wall -march=pentium4 -s -funroll-loops -fomit-frame-pointer -O3 l +oops.c -o loops.exe` [download] When you say that you were able to generate all the solutions in Perl in 74 mins on 1 machine was it using blokhead's code without Memoize or your modification to that code? I ask because then we would be comparing apples and oranges. I had a completely different algorithm. Cheers - L~R Update: Added second hyphen to -fomit-frame-pointer	[reply] [d/l]
Re^9: Challenge: Number of unique ways to reach target sum by fergal (Chaplain) on Feb 15, 2006 at 16:26 UTC
Re^10: Challenge: Number of unique ways to reach target sum by Limbic~Region (Chancellor) on Feb 16, 2006 at 12:42 UTC
Some notes below your chosen depth have not been shown here

• hippo

‥ epoptai's answer Re: how do I set a cookie and redirect was blessed by hippo!

• erzuuli

‥ Anonymous Monks are no longer allowed to use Super Search, due to an excessive use of this resource by robots.


Come for the quick hacks, stay for the epiphanies.
	PerlMonks