### Possible Answer

Stack Overflow is a question and answer site for professional and enthusiast programmers. It's 100% free, no registration required. - read more

Worst case space complexity: O(n) auxiliary: In computer science, merge sort (also commonly spelled mergesort) is an O(n log n) comparison-based sorting algorithm. ... If the running time of merge sort for a list of length n is T(n), ... - read more

Please vote if the answer you were given helped you or not, thats the best way to improve our algorithm. You can also submit an answer or search documents about time and space complexity of merge sor.