Heh, changing the set to 1..20 and the desired sum to 30, I got the following run times:
Seconds | Author |
---|---|
0 | tye |
10 | Solo |
24 | kvale |
673 | BrowserUK |
Just a quick, cheap benchmark. (:
- tye
In reply to Re^2: Better algorithm than brute-force stack for combinatorial problems? (Benchmarks)
by tye
in thread Better algorithm than brute-force stack for combinatorial problems?
by Solo
For: | Use: | ||
& | & | ||
< | < | ||
> | > | ||
[ | [ | ||
] | ] |