Merge sort is an O(n log n) worst-case comparison-based stable sorting algorithm.
Timsort is a sorting algorithm invented by Tim Peters, designed to take advantage of partial ordering in data
|More complex algorithm||
"Timsort is used by python and java for their sort methods and is rather supernaturally fast but it s a more complex algorithm than mergesort which matters if you re working in something like c - so if you just need something that works pretty well and is simple go with mergesort"
from question "Sorting 2^30 number of 32 bit integers. Best solutions"