On Sat, 11 Feb 2006 13:33:58 +, Ian Bygrave wrote:
> Well, given a hypothetical new function 'sieve'
which should have been:
def sieve(f,l):
if not l:
return l
head,tail=l[0],l[1:]
def filter_func(x):
return f(x,head)
tail=filter(filter_func,tai
On Sat, 11 Feb 2006 12:43:23 +, Ian Bygrave wrote:
> p,r=[],range(2,99)
> while r:p,r=p+r[:1],[x for x in r if x%r[0]]
>
> And the result's in p.
Well, given a hypothetical new function 'sieve'
def sieve(f,l):
if not l:
return l
head,tail=l[0],
>
> r=range(2,99)
> m=[x*y for x in r for y in r]
> [x for x in r if not x in m]
I swore I'd never play Python golf.
p,r=[],range(2,99)
while r:p,r=p+r[:1],[x for x in r if x%r[0]]
And the result's in p.
--Ian Bygrave
--
http://mail.python.org/mailman/listinfo/python-list
