Mergesort

• O(n lg(n)) behavior is very advantageous because we are dealing with extremely large amounts of data to sort.

• The fact that merge sort requires twice as much space (memory) than quicksort to perform its task will not be an issue because we are dealing with an environment that provides excessive amounts of space. (disk)