title: Time complexity of QuickSort+Insertion sort hybrid algorithm?
body: <p>I am implementing an algorithm that perform Quick sort with Leftmost pivot selection up to a certain limit and when the list of arrays becomes almost sorted, I will use Insertion sort to sort those elements. </p>
  
  <p>For left most pivot selection,I know the Average case complexity of Quick sort is O(nlogn) and worst case complexity ,i.e. when the list is almost sorted, is O(n^2). On the other hand, Insertion sort is very efficient on almost sorted list of elements with a complexity is O(n).
  SO I think the complexity of this hybrid algorithm should be O(n). Am I correct?</p>