summaryrefslogtreecommitdiffstats
path: root/guile/net/ricketyspace/taocp/utils/math.scm
blob: e910bc8a9b4d9f2d975cf32176525e244306f4d5 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
;;;; copyright 2016 rsiddharth <s@ricketyspace.net>
;;;; under gnu general public license version 3 or higher.

(define-module (net ricketyspace taocp utils math)
  #:use-module (srfi srfi-1)
  #:export (compute-exp1-n
            fib
            fib-range))

(define (compute-exp1-n fx n)
  "Evaluate function FX for `x` equals 1 to N and return all results
as a list

Expression FX is a function that takes exactly one arugment.

For instance `(lambda (x) (* x x))` is a valid FX.
"
  (cond ((= n 0) '())
        (else (cons (fx n) (compute-exp1-n fx (1- n))))))

(define (fib n)
  "Returns Fibonacci of N.

This function is useless for large values of N. Use `fib-fast`
function defined in (taocp one two eight fib).
"
  (cond ((= n 0) 0)
        ((= n 1) 1)
        (else (+ (fib (- n 1)) (fib (- n 2))))))

(define (fib-range start end)
  "Returns Fibonacci sequence between START and END.

This function is useless wher START/END is large. Use `fib-fast-range`
function defined in (taocp one two eight fib).
"
  (let ((f (lambda (x) (cons x (fib x))))
        (count (1+ (- end start ))))
  (map f (iota count start))))