;; Turn off our memoization feature so we get a fair "raw" recursion test against RustHE
;; however our runtime TCOs EVERYTHING so we are in this case 1M+ times faster than RustHE

;; !(pragma! tabling false)  ;; if uncommented fib1/1 finishes 700 times faster yet
;; makes this file be treated as if the command line --compile=full  was supplied
!(pragma! compile full)

(= (fib $n)
    (if (== $n 0)
        0
        (if (== $n 1)
            1
            (+ (fib (- $n 1)) (fib (- $n 2))))))

(= (fib1 $a $b $n $i)
   (if (< $n 3)
        (fib $n)
        (if (== $i (- $n 2))
             (+ $a $b)
            (fib1 $b (+ $a $b) $n (+ $i 1)))))

!(println! (fib1 0 1 900 0))

(= (fib1 $n) (fib1 0 1 $n 0))

!(println! (fib1 900))