Some comments regarding the complexity class

Mergesort is very efficient and is guaranteed to be in O(n log n). 
There is no disctinction between a 'best', 'average' or 'worst case'. 
However, MergeSort requires additional space (for the temporary array).