(********************************************************************) (* OCaml code from the book ``Learn Programming with OCaml'' *) (* See https://usr.lmf.cnrs.fr/lpo/ *) (* *) (* Sylvain Conchon and Jean-Christophe Filliâtre *) (* Copyright 2025 Université Paris-Saclay and CNRS *) (* *) (* Openly licensed via CC BY SA 4.0 *) (* See https://creativecommons.org/licenses/by-sa/4.0/deed.en *) (********************************************************************) (* Program 84 on page 360 Computing Fn via memoization *) let memo = Hashtbl.create 17 let rec fib_memo n = try Hashtbl.find memo n with Not_found -> let fn = if n <= 1 then n else fib_memo (n-2) + fib_memo (n-1) in Hashtbl.add memo n fn; fn
This document was generated using caml2html