All Questions
Tagged with sorting computer-science
1
question
5
votes
5
answers
35k
views
Merge Sort time complexity analysis
How can I prove that $T(n) = 2T(n/2) + n$ is $O(n \log n)$ ?