https://ankitbahuguna.xyz/tags/recursion/ Recent content in recursion on ankit bahuguna Hugo -- gohugo.io en Thu, 24 Aug 2023 18:48:12 +0530 https://ankitbahuguna.xyz/posts/benchmarking-recursive-and-tail-recursive-functions-in-ocaml/ Thu, 24 Aug 2023 18:48:12 +0530 https://ankitbahuguna.xyz/posts/benchmarking-recursive-and-tail-recursive-functions-in-ocaml/ This post is a continuation of the my last post . I did some benchmarking for recursive and non-recursive version of sum function. open Unix (* Tail recursive version *) let min_list_tail lst = let rec min_tail lst acc = match lst with | [] -> acc | h :: t -> min_tail t (if h < acc then h else acc) in match lst with | [] -> failwith "Empty list" | h :: t -> min_tail t h (* Non-tail recursive version *) let rec min_list_non_tail = function | [] -> failwith "Empty list" | [x] -> x | h :: t -> let min_tail = min_list_non_tail t in if h < min_tail then h else min_tail let generate_large_list size = List. https://ankitbahuguna.xyz/posts/undertanding-tail-recursion/ Tue, 15 Aug 2023 01:55:25 +0530 https://ankitbahuguna.xyz/posts/undertanding-tail-recursion/ I’ve been playing around with OCaml lately and wanted to understand how tail recursion works. According to Wikipedia: “In computer science, a tail call is a subroutine call performed as the final action of a procedure. If the target of a tail is the same subroutine, the subroutine is said to be tail recursive, which is a special case of direct recursion.” Non-Tail Recursive Sum Function in OCaml Here’s a non-tail recursive sum function in OCaml: