let rec small l1 = match l1 with h::[] -> h | (h::t) -> let smallest = small t in if h < smallest then h else smallest;; small [3;4;2;1];; So basically what I understand from this function is that it compares the head (3) with the second elementand picks out the smallest? But …

Can some one explain how this function recursively picks out the smallest integer?

superlativ27 August 11, 2018, 4:34pm 9

Much appreciated, thank you!

Topic		Replies	Views
What do you do when you have trouble grokking a recursive algorithm? Learning	13	1042	February 6, 2024
How do I reduce complexity of this algorithm that take first and last element? Learning	27	1011	February 16, 2024
I am having hard time understanding ti let ..... in expression Learning	2	657	April 24, 2019
Function Ocaml Generate combination Learning	6	2182	January 8, 2019
What is the simplest example of mutual recursion? Learning	4	8532	December 28, 2020