title: sorting algorithm suitable for a sorted list
body: <p>I have a sorted list at hand. Now i add a new element to the end of the list. Which sorting algorithm is suitable for such scenario? </p>
  
  <p>Quick sort has worst case time complexity of O(n<sup>2</sup>) when the list is already sorted. Does this mean time complexity if quick sort is used in the above case will be close to O(n<sup>2</sup>)?</p>