### 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: Merge sort animation. The sorted elements are represented by dots. ... If the running time of merge sort for a list of length n is T(n), then the recurrence 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.