title: How to apply binary search O(log n) on a sorted linked list?
body: <p>Recently I came across one interesting question on linked list. Sorted singly linked list is given and we have to search one element from this list. </p>
  
  <p>Time complexity should not be more than <code>O(log n)</code>. This seems that we need to apply binary search on this linked list. How? As linked list does not provide random access if we try to apply binary search algorithm it will reach O(n) as we need to find length of the list and go to the middle.</p>
  
  <p>Any ideas? </p>