title: Sorting lists, which algorithm is appropriate to use?
body: <p>I've come to understand that when sorting say a LinkedList, it's better to use merge sort because when you want to put something in the middle of the list you do it in O(1) (constant) time and O(1) memory. therefore merge sort can be done without using up extra space.</p>
  
  <p>My questions are: which sorting algorithm should one use on an ArrayList? Does it matter which datatype you're sorting?</p>
  
  <p>Please correct me if I'm wrong about LinkedList or let me know if I've missed something (some argument for using merge for example).</p>