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

Published by Pearson Higher Education

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

#### Answer

Binary search -sequential search -insertion search

#### Work Step by Step

The binary search belongs to Θ(lg n), the sequential search belongs to Θ(n), and the insertion sort belongs to Θ($n2$).

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.