title: Leftmost-Innermost and Outermost (Haskell)
body: <p>I have to show how much steps Haskell needs to calculate (Two ways - leftmost innermost and leftmost outermost). It's for the function</p>
  
  <pre><code>minimum [7,4,2,8]
  </code></pre>
  
  <p>Minimum is defined as </p>
  
  <pre><code>minimum xs = head (isort xs)
  </code></pre>
  
  <p>So the innermost (?) steps are:</p>
  
  <pre><code>1. minimum [7,4,2,8]
  2. head (isort [7,4,2,8])
  3. head (isort [4,7,2,8])
  4. head (isort [2,4,7,8])
  5. head [2:4:7:8]
  6. (The output) =&gt; 2
  </code></pre>
  
  <p>Am I right? I can't see an other way to solve it.. but there should be one..?</p>
  
  <p>(sorry for bad english)..</p>
  
  <p>Thanks for help.</p>