recursive fibonacci scheme
(define (fib2 n)
(let loop
((m 0)
(k 1)
(count n))
(if (= count 0)
m
(loop k (+ m k) (- count 1)))))
4.43
7
(define (fib n)
(cond
((= n 0) 0)
((= n 1) 1)
(else
(+ (fib (- n 1))
(fib (- n 2))))))
Thank you!
7
0
Are there any code examples left?
New code examples in category Scheme
-
Scheme 2021-11-20 06:41:13 how to pass unction in scheme
-
Scheme 2021-10-24 16:50:11 change scheme name xcode