returning none when it should be returning a list?

[randomtalk]

hello, i have another problem i feel that i have to be missing
something.. Basically, i've written a recursive function to find all
the prime up to a number (lim).. here is the function:

The function basically takes in a list of all the prime number found,
it takes the next number to be tested for (next) and the limit it will
go up to. It divide next by the list of previous prime numbers if next
is not bigger than lim, count up all the times where it's not evenly
divdided, if the result is equal the length of prime number, then we
have another prime number, lather rinse and repeat :)

def findPrime(seed, next, lim):
print("seed: " + str(seed) + " next: " + str(next) + " lim: " +
str(lim))
print(seed)
if(next >= lim):
print(seed)
return seed
else:
count = 0;
for num in seed:
modu = math.modf(float (next)/float(num));
if(modu[0] > 0):
count += 1
if(count == len(seed)):
seed.append(nex t)
findPrime(seed, next+2, lim)
else:
findPrime(seed, next+2, lim)

As you can probably see, i've printed the value of seed up until the
point where i'm returning the seed, however, the function still returns
None..

[Christos Georgiou]

On 2 May 2006 03:03:45 -0700, rumours say that "Iain King"
<ia******@gmail .com> might have written:

John Machin wrote:

# Doh! Looks like recursion not necessary. Google 'eliminate tail
recursion' :-)

I did, and found this:
http://www.biglist.com/lists/dssslis.../msg00389.html
which explains that the Scheme compiler optimises (obvious) tail
recursion into iterative code. I'm wondering if the python compiler
does the same?

No, it doesn't so far.

More info:

<URL:http://groups.google.c om/groups/search?q=group% 3Acomp.lang.pyt hon+tail+recurs ion+optimizatio n&qt_s=Search >
--
TZOTZIOY, I speak England very best.
"Dear Paul,
please stop spamming us."
The Corinthians