title: Time complexity for Insertion and deletion of elements from an ordered list
body: <p>Is the time complexity for both operations equal to O(log n)?
  Remeber: the list is ordered, always ordered, and not double linked.</p>