Question: Use OCAML 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
Use OCAML 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.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
