When an array has already been sorted and you are looking for only a single match, search algorithms other than a sequential search are more efficient, even with a Boolean flag for an early exit.

Question

Quizplus · Accepted Answer

Binary search is an example of a more efficient algorithm in this scenario, as it can find an element in a sorted array in O(log n) time, compared to the O(n) time of a sequential search, even with an early exit upon finding a match.

When an Array Has Already Been Sorted and You Are