/Scheme/Recursive fibonacci scheme

Recursive fibonacci scheme

Recursive fibonacci scheme

  (define (fib2 n)
    (let loop
      ((m 0)
       (k 1)
       (count n))
      (if (= count 0)
        m
        (loop k (+ m k) (- count 1)))))

0

Source: wiki.c2.com

Recursive fibonacci scheme

  (define (fib n)
    (cond
      ((= n 0) 0)
      ((= n 1) 1)
      (else
        (+ (fib (- n 1))
           (fib (- n 2))))))

0

Source: wiki.c2.com

Similar codes

0 vote233 views1 answer
No authenticationScheme was specified, and there was no DefaultChallengeScheme found
Scheme
0 vote250 views1 answer
How to make a list in scheme
Scheme
0 vote245 views1 answer
Scheme union of two lists
Scheme
0 vote243 views1 answer
Kdenlive download ubuntu
Scheme
0 vote244 views1 answer
Kdenlive apt command
Scheme
0 vote248 views1 answer
Request.Scheme request.Path
Scheme
1 vote237 views1 answer
Vim default colour schemes
Scheme
0 vote235 views1 answer
Org.apache.hadoop.fs.unsupportedfilesystemexception: no filesystem for scheme "s3" spark
Scheme
0 vote249 views2 answers
Scheme tmLanguage
Scheme
-3 votes283 views3 answers
Ponzi schemes
Scheme

Share