title: How to find the second smallest number of a list in OCaml using fold_left?
body: <p>So far, I have a little code snippet that searches for the minimum value in a list</p>
  <pre><code>let sec_small lst =
    let min_helper min curr =
      if (min &lt; curr) then min 
      else curr
    in 
    List.fold_left min_helper (List.hd lst) lst
  </code></pre>
  <p>Which is a bit of code that returns the minimum value of a list. I'm just wondering, how should I proceed to make it so that I can look for the second smallest element of a list?</p>