title: Searching a combined 2 sorted array
body: <p>Can an algorithm search a <strong>combined 2 sorted array</strong> in O( log(n) ) ??
  <br/></p>
  
  <p><strong>Combined 2 sorted array</strong>:<br/>
  Is a combination of 2 sorted arrays..<br/>
  Example:
  {1,2,3,4,5} + {2,3,4,5,6,7,} = {1,2,3,4,5,2,3,4,5,6,7}<br/>
  Unfortunately, you do not know the boundary of them</p>
  
  <p>*Please note I know a solution that gives O( log(n) ) in amortized time, but I need that O( log(n) ) in only one search..</p>
  
  <p><em>Edit:</em> You can assume distinct elements</p>
  
  <p>Thanks</p>