Asequential search of a sorted list can halt when the target is less than a given element in the list. define a modified version of this algorithm, and state the computational complexity, using big-o notation, of its best-, worst-, and average case performances.