Hello people, considering that 1) tail recursion is faster than non-tail-recursion (because it does not have put a call in the stack for each iteration)
2) it is possible to convert any non-tail-recursive function into a tail-recursive function Is worth it to rewrite functions in tail-recursive ? Is Ocaml compiler already converting my non-tail recursive functions into tail version, when compiling? Since this conversion can be made by a compiler, why bother to rewrite ? Tail-recursive code can be harder to reason about. -- You received this message because you are subscribed to the Google Groups "ocaml-developer" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/ocaml-developer?hl=en For other OCaml forums, see http://caml.inria.fr/resources/forums.en.html
