title: Set up a recurrence relation for the algorithm’s basic operation count and solve it
body: <p>Consider the following algorithm</p>
  
  <pre><code>ALGORITHM Find(A[0..n‐1])
      if n ==1 return A[0]
      else temp = Find(A[0..n‐2])
      if temp ≤ A[n‐1] return temp
      else return A[n‐1]
  
  a. What does this algorithm compute?
  b. Set up a recurrence relation for the algorithm’s basic operation count and solve it.
  </code></pre>
  
  <p>Does this algo return A[0],A[0..3],A[0..5],A[0.7],A[0..8], perhaps for n=9? Am I on the right track?</p>
  
  <p>Appreciate if someone could give me along!
  Thanks!</p>