FIND THE ANSWERS

Computer algorithms and complexity question: If the time complexity of Merge Sort is T(n), why is T(n)= 2T(n/2) + cn?

Answer this question

  • Computer algorithms and complexity question: If the time complexity of Merge Sort is T(n), why is T(n)= 2T(n/2) + cn?


Answers