title: Algorithm to return the smallest integer in the whole set
body: <p>I can't seem to get my head around the off-line minimum algo. Can someone explain it to me more?
  Possibly with pseudo-code in a "near-code" fashion.
  Say, for example, that I have the following sequence: </p>
  
  <pre><code>"5","4","6","E","1","7","E","E","3","2"
  </code></pre>
  
  <p><strong>What are the steps to return the smallest integer in the whole set.</strong> I understand the problem but I don't seem to find a way to code it.</p>
  
  <p>Regards</p>