Question

Use Ocaml language to writing function called warmups.ml Write this function in a pure functional style only: no assignment statements, no explicit loops, and no arrays!

Here are the problem you have to solve:

Write a new factorial function using pattern matching which is tail-recursive (i.e. it doesn't cause the stack to grow and there are no pending operations). You will need an internal helper function

Answer 1

ANSWER:

Below is the factorial function using helper function:

(defn helper [acc n]
(if (zero? n)
acc
(helper (* acc n) (dec n))))

(defn recurssive-factorial [n]
(helper 1 n))