Computer Science: An Overview: Global Edition (12th Edition)

Published by Pearson Higher Education
ISBN 10: 1292061162
ISBN 13: 978-1-29206-116-0

Chapter 5 - Algorithms - Section 5.6 - Efficiency and Correctness - Questions & Exercises - Page 262: 3


Θ(lg n)

Work Step by Step

The class Θ(lg n) is most efficient, followed by Θ(n), $Θ(n^2)$, and $Θ(n^3)$.
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.