title: Finding swapped elements in less than O(n) time?
body: <p>Given a sorted array, and two elements one from left half and other from the right are swapped.Find the swapped elements.</p>
  
  <p>The answer is obvious in O(n), but I want to know is it possible in O(log n)?</p>