Logarithmic solution of Fibonacci algorithm construction and interpretation of computer program exercise 1.19

The program is written in the scheme language and will be implemented in other languages later.

#lang Racket;Fibonacci Logarithm Method;Filter(define (fib N) (Fib-iter1 0 0 1N)) (define (square x) (* x x)) (define (Fib-iter a b p q count) (Cond (= count 0) b);count = 0 o'clock, fib (1) = 0(even. Count);if it is an even number, then the value of P,q is         ;p = p^2 + q^2         ;q = 2pq + q^2         ;the number of count is halved( Fib-iter a B (+ (square p) (square Q)) (+ (*2p Q)                  (square Q)) (/Count2)))        ;if not, that is odd, then go to the next operation by lowering the power(Else (fib-iter (* b q) (* a Q) (* a P)) (+ (* b q) (* a Q)) p Q (-Count1))))

Logarithmic solution of Fibonacci algorithm construction and interpretation of computer program exercise 1.19