How Linear Search Works
Linear search compares values one at a time, starting from the beginning of the array. It keeps comparing until it finds the target or reaches the end of the array. When the target sits near the end of the array, or isn't in the array at all, it takes as many comparisons as there are elements.
Searching for target 2 in [5, 2, 8, 1, 9, 3, 7, 4], which comparison finds it?