Invitation to Computer Science 8th Edition

Published by Cengage Learning
ISBN 10: 1337561916
ISBN 13: 978-1-33756-191-4

Chapter 3 - Exercises - Page 143: 17c


\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

Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.