Posted
by John Retallack
on Stack Overflow
See other posts from Stack Overflow
or by John Retallack
Published on 2010-05-05T14:03:42Z
Indexed on
2010/05/05
14:08 UTC
Read the original article
Hit count: 429
How can I pass a list as a parameter to a function adding elements to it recursively,and have it unmodified when it comes out of recursion?
© Stack Overflow or respective owner
as seen on Stack Overflow
- Search for 'Stack Overflow'
I had a pretty simple requirement in my Scheme program to execute more
than one statement, in the true condition of a 'if'. . So I write my
code, something like this:
(if (= 1 1)
((expression1) (expression2)) ; these 2 expressions are to be
executed when the condition is true
(expression3)…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
(define (read-all-input)
(local ((define line (bytes->list (read-bytes 4))))
(if (eof-object? line)
empty
(cons line (read-all-input)))))
(void (read-all-input))
The above code fails because bytes-list expects an argument of type byte string, but is given #
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Does R6RS or Chez Scheme v7.9.4 have a library function to check if a list contains duplicate elements?
Alternatively, do either have any built in functionality for sets (which dis-allow duplicate elements)? So far, I've only been able to find an example here.
The problem with that is that it doesn't…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Isn't it possible to treat functions in Scheme as any other list?
Basically, what I want do to is something like this:
(define (foo) "hello")
(cdr foo) ; or similar, should return the list ((foo) "hello")
I've found a similar discussion about this, and I feel a bit disappointed if this is not…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Hi,
I'm a beginning student in CS, and my classes are mostly in Java. I'm currently going through "Little Schemer" as a self study, and in the process of finding out how to do that I have found numerous references to "implementations" of Scheme. My question is, what are implementations?
Are they…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
Can someone give me the difference between these two kinds recursions and example?
specifically in ocaml. Thanks
>>> More
as seen on Programmers
- Search for 'Programmers'
I am about to make two assumptions. Please correct me if they're wrong:
There isn't a recursive algorithm without an iterative equivalent.
Iteration is always cheaper performance-wise than recursion (at
least in general purpose languages such as Java, C++, Python etc.).
If it's true that recursion…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I solved Problem 10 of Project Euler with the following code, which works through brute force:
def isPrime(n):
for x in range(2, int(n**0.5)+1):
if n % x == 0:
return False
return True
def primeList(n):
primes = []
for i in range(2,n):
if isPrime(i):
…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
I have this massive array of ints from 0-4 in this triangle. I am trying to learn dynamic programming with Ruby and would like some assistance in calculating the number of paths in the triangle that meet three criterion:
You must start at one of the zero points in the row with 70 elements.
Your…
>>> More
as seen on Stack Overflow
- Search for 'Stack Overflow'
code 1:
public static int fibonacci (int n){
if (n == 0 || n == 1) {
return 1;
} else {
return fibonacci (n-1) + fibonacci (n-2);
}
}
how can you use fibonacci if you haven't gotten done explaining what it is yet? I've been able to understand…
>>> More
