Generally when we think about sorting elements in a list, we’re thinking about comparison sorting algorithms. Very well known algorithms of this kind are, for example, Quicksort or Merge Sort. So what do we mean when we say O(nlog)? This type of notation (called big O notation) describes us the limit an algorithm can have, in terms of its input. We’re normally interested either on their average or worst case....