A-M baby

Task/Fibonacci-sequence/Scheme/fibonacci-sequence-1.ss

@@ -0,0 +1,5 @@
+(define (fib-iter n)
+  (do ((num 2 (+ num 1))
+       (fib-prev 1 fib)
+       (fib 1 (+ fib fib-prev)))
+      ((>= num n) fib)))

Task/Fibonacci-sequence/Scheme/fibonacci-sequence-2.ss

@@ -0,0 +1,5 @@
+(define (fib-rec n)
+  (if (< n 2)
+      n
+      (+ (fib-rec (- n 1))
+         (fib-rec (- n 2)))))

Task/Fibonacci-sequence/Scheme/fibonacci-sequence-3.ss

@@ -0,0 +1,4 @@
+(define (fib n)
+  (let loop ((a 0) (b 1) (n n))
+    (if (= n 0) a
+        (loop b (+ a b) (- n 1)))))

Task/Fibonacci-sequence/Scheme/fibonacci-sequence-4.ss

@@ -0,0 +1,19 @@
+;;; Fibonacci numbers using Edsger Dijkstra's algorithm
+;;; http://www.cs.utexas.edu/users/EWD/ewd06xx/EWD654.PDF
+
+(define (fib n)
+  (define (fib-aux a b p q count)
+    (cond ((= count 0) b)
+          ((even? count)
+           (fib-aux a
+                    b
+                    (+ (* p p) (* q q))
+                    (+ (* q q) (* 2 p q))
+                    (/ count 2)))
+          (else
+           (fib-aux (+ (* b q) (* a q) (* a p))
+                    (+ (* b p) (* a q))
+                    p
+                    q
+                    (- count 1)))))
+  (fib-aux 1 0 0 1 n))