title: Recursion function to find highest value returns 0s
body: <pre><code>#find highest number
  
  def HighValue(arr, HighestValue=0):
      if len(arr) &gt; 0:
          arrayValue = arr.pop()
      if len(arr) == 0:
          return HighestValue
      elif HighestValue &lt;= arrayValue:
          HighestValue = arrayValue
          return HighValue(arr, HighestValue)
      else:
          return HighValue(arr, HighestValue)
  
  print HighValue([1,2,3,4,5,6,7,8,9])
  </code></pre>
  
  <p>This function returns the highest value of an array using recursion. It works, but I feel like I am writing more code than necessary. Does anyone have any advice as to whether I could have made this recursion algorithm simpler? I hope I am allowed to ask quesitons like that here. If not, let me know. I feel I will get better if I get feedback from more experienced programers.</p>
  
  <p>Let me know what you think.</p>