Question: the number of comparisons needed in the worst case by the merge sort algorithm will be
Answer: O ( n log n )