Recursion · Functional programming in Caml

Version without JavaScript, read-only: workshops, quizzes and running code are not available here. Full version · Catalogue · Sign in

Recursion

Writing recursive functions on integers, displaying with recursion, reasoning about termination and counting calls. Chapter 5.

Exercise · Termination

For each function, say for which values of n it terminates.

let rec syracuse n =
  if n = 1 then 0
  else if n mod 2 = 0 then 1 + syracuse (n / 2)
  else 1 + syracuse (3 * n + 1) ;;