Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Fibonacci in Scheme
(define (fibonacci n) (let fibonacci-of ((i 2) (prev 0) (res 1)) (if (>= i n) res (fibonacci-of (+ i 1) res (+ prev res))))) (define (main n) (display (fibonacci n)) (newline)) (main 100000) ;; (main (read))
run
|
edit
|
history
|
help
0
Infinite lists
powerset
Range List for Scheme
Pruebas
Find Euler's number
Toy implementation of classes using closures
Number of prime numbers in a list
1.11
So
99 LISP PROBS