Consider a program that needs to perform a complex search operation on a large dataset. Which algorithm would be the most efficient if the dataset is already sorted?
Correct: B
Binary search is the most efficient algorithm for searching a sorted dataset. It has a time complexity of O(log n), significantly faster than linear search (O(n)) or sorting algorithms (O(n^2) or O(n log n)) when the data is already sorted.