Check each element sequentially until the target is found or end reached.
Worst-case: N steps, O(N).
SC1303
Programming with Data Structures & Algorithms
Check each element sequentially until the target is found or end reached.
Worst-case: N steps, O(N).