Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
1.11
;guile 2.0.11 ;;(display "Hello, World!") (define (fRecur n) (if (< n 3) n (+ (fRecur (- n 1)) (* 2 (fRecur (- n 2))) (* 3 (fRecur (- n 3)))) )) (define (fIter n) (iter 0 1 2 n)) (define (iter a b c n) (if (= n 0) a (iter b c (+ c (* 2 b) (* 3 a)) (- n 1))) ) (display (fIter 3)) (display "\n") (display (fRecur 3))
run
|
edit
|
history
|
help
0
Find Euler's number
Fibonacci in Scheme
Pruebas
So
powerset
99 LISP PROBS
Toy implementation of classes using closures
Infinite lists
Range List for Scheme
Number of prime numbers in a list