Talk:Weird numbers: Difference between revisions
→A faster and less ambitious algorithm ?: Updated sample function
(→A faster and less ambitious algorithm ?: Updated sample function) |
|||
Line 25:
def anySum(n, xs):
'''First subset of xs found to sum to n.
(Probably more efficient where
order of magnitude)'''
def go(n, xs):
Line 46:
print(anySum(7, [1,1,1,1,1,6]))
# -> [1, 6]
print(anySum(7, [6, 3]))
# -> []</lang>
| |||