Michael Schimmel
2cc47c557b
This commit updates the benchmark results for various examples. The benchmark times and repeat counts have been adjusted to reflect current performance characteristics.
18 lines
420 B
Plaintext
18 lines
420 B
Plaintext
;; Takeuchi Function Benchmark
|
|
;; heavily recursive, benefits significantly from specialization of integer arithmetic
|
|
;; and direct function calls (skipping dynamic dispatch).
|
|
;; Output: 5
|
|
|
|
;; Benchmark: 413.3us
|
|
;; Benchmark-Repeat: 6
|
|
|
|
(do
|
|
(def tak (fn [x y z]
|
|
(if (<= x y)
|
|
z
|
|
(tak (tak (- x 1) y z)
|
|
(tak (- y 1) z x)
|
|
(tak (- z 1) x y)))))
|
|
|
|
(tak 12 8 4)
|
|
)
|