Subset sum problem: Difference between revisions
Content added Content deleted
m (→Alternative) |
|||
Line 1,443: | Line 1,443: | ||
===Alternative=== |
===Alternative=== |
||
Using the harder set of weights from Go, and the version 1 approach of Python (modified to omit words and |
Using the harder set of weights from Go, and the version 1 approach of Python (modified to omit words and |
||
using dictionary so that fractional weights can be accomodated).<br> |
using a dictionary so that fractional weights can be accomodated).<br> |
||
This is significantly faster (near instant, in fact) than an "all possible combinations" approach.<br> |
This is significantly faster (near instant, in fact) than an "all possible combinations" approach.<br> |
||
Note that new_dict(tid) has been introduced for this task in 0.8.0, which has not yet been shipped. |
Note that new_dict(tid) has been introduced for this task in 0.8.0, which has not yet been shipped. |