Answer
\begin{array}{l}{\text { From the above, me make a recursive equation. If the time taken to merge }} \\ {\text { sort a list of n elements is } t(n), \text { we get the recursive equation: }} \\ {\qquad t(n)=t(n / 2)+\Theta(n)} \\ {\text { Solving the equation, we get: }} \\ {\qquad t(n)=\Theta(n \log n)}\end{array}
Work Step by Step
--
