title: When to use sorts over another
body: <p>Among Quicksort, MergeSort, and Binary Insertion Sort, is there ever a situation to use any one of these over the other?</p>
  
  <p>I know things like Quicksort can become problematic on an almost-sorted list (but I believe the random assignment of the pivot can eliminate the worst case time), so it may be better to use MergeSort. MergeSort may use more space than QuickSort, I'm not entirely sure and Merge may be better for LinkedLists.</p>
  
  <p>And I'm guessing Binary Insertion Sort is better for smaller lists? If so, is there a threshold for using this or is the size just left up to interpretation? Like, if the list is size 3 should we use Binary Insertion sort over Quick or Merge?</p>