title: complexity of the insertion sort using Doubly Linked List?
body: <blockquote>
    <p>Insertion sort requires insertion of an element in sorted order by
    shifting the elements of an already sorted list while implemented
    through array. If instead of using arrays, we use doubly linked-list,
    what would be the time complexity?</p>
  </blockquote>
  
  <p>Time Complexity Comes out to be O(n^2)? Why? 
  If we consider insertion for n elements then it will be 
  log(1) + log(2) + log(3) + ..... + log(n) - n times for n elements
  hence complexity should be O(nlogn)</p>