title: A recursive algorithm to find two integers in an array that sums to a given integer
body: <p>I need an algorithm to determine if an array contains two elements that sum to a given integer.</p>
  
  <p>The array is sorted.</p>
  
  <p>The algorithm should be <strong>recursive</strong> and runs in O(n).</p>
  
  <p>The recursive step should be based on the sum, meaning the method passes the sum and return true or false depending on the end result (if two elements are found - return true, else - return false)</p>
  
  <p>Only linear data structures can be used.</p>
  
  <p>Any ideas are appreciated..</p>