Fundamentals/Best, Worst, and Average Case
← PrevNext →
Given a sorted array and a target, return the index of the target using linear search; the worst case is when the target is missing or last.