Skip to main content

All Questions

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)$ ?
Dan's user avatar
  • 53