title: Worst case time complexity lists
body: <p>I know that the best, average and worst case time complexities of binary search are at
  Best O(1);
  Average O(log n);
  Worst O(log n); for an array implementation. Likewise, I know that the best, average and worst case time complexities of insertion sort are at 
  Best O(n);
  Average O(n^2);
  Worst O(n^2); for an array implementation.</p>
  
  <p>However, how would I work out the time complexities of say binary search and insertion sort of singly linked lists; doubly linked lists; and circular linked lists implementations?</p>