You are given a sorted list of book titles and are asked to locate a title within the data and report on the author. What would be the most appropriate algorithm to use?(1 point)

Question

Responses

merge sort
merge sort

linear search
linear search

bubble sort
bubble sort

binary search

Answer 1

The most appropriate algorithm to use for locating a title within a sorted list of book titles is binary search.

Binary search is efficient for sorted data, as it repeatedly divides the search interval in half, allowing for a logarithmic time complexity (O(log n)), making it much faster than a linear search (O(n)) for large datasets.