Re: Stack overflow in relatively simple programs
- From: fairchild.anthony@xxxxxxxxx
- Date: 30 Dec 2006 19:02:24 -0800
robinganemccalla@xxxxxxxxx wrote:
Neither of these functions gets past primes in the 6000s... Am I
missing out on something tremendously inefficient in my code or is
their some problem with LISP? Any help would be greatly appreciated, I
don't want answers to the problem I just want to know why my answers
aren't working.
I believe this is more a problem with your algorithms and not Lisp. I
suggest looking into non-recursive methods for calculating primes.
Check out the Sieve of Eratosthenes algorithm.
http://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
Hope this helps,
AnthonyF
.
- Follow-Ups:
- Re: Stack overflow in relatively simple programs
- From: Dan Bensen
- Re: Stack overflow in relatively simple programs
- References:
- Stack overflow in relatively simple programs
- From: robinganemccalla@xxxxxxxxx
- Stack overflow in relatively simple programs
- Prev by Date: Stack overflow in relatively simple programs
- Next by Date: Re: Stack overflow in relatively simple programs
- Previous by thread: Stack overflow in relatively simple programs
- Next by thread: Re: Stack overflow in relatively simple programs
- Index(es):
Relevant Pages
|