title: Find the minimum number in an array
body: <p>I had gone through many articles over internet to  find minimum number in an array. According to article they iterate an array n number of times but purpose can be achieve n/2 + 1 iteration </p>
  
  <p>Here is my code</p>
  
  <pre><code>for index in range(0, int(len(myArray)/2)+1):
   if minNum &gt; myArray[index]:
      minNum = myArray[index]
  
   lastElement = - index - 1
  
   if minNum &gt; myArray[lastElement]:
      minNum = myArray[lastElement]
  </code></pre>
  
  <p>Article code</p>
  
  <pre><code>for element in myArray:
    if minNum &gt; element:
      minNum = element
  </code></pre>
  
  <p>Update my code to </p>
  
  <pre><code>for index in range(0, int(len(myArray)/2)+1):
   if minNum &gt; myArray[index]:
      minNum = myArray[index]
  
   if minNum &gt; myArray[- index - 1]:
      minNum = myArray[- index - 1]
  </code></pre>
  
  <p>Is there is any reason why they used n iteration</p>