Learn how to implement the *Linear Search algorithm in Python* step by step. In this beginner‑friendly tutorial, we'll cover:
What is *linear search* (also known as sequential search)
How to write a *linear_search(arr, target)* function in Python
Time complexity analysis: Best case O(1), Average/Worst case O(n)
Why and when to use linear search vs. binary search or hash lookup
Real code examples, edge cases (target not found returns –1), and tips to avoid off-by-one errors
*Code snippet* included:
```python
def linear_search(arr, target):
for i in range(len(arr)):
if arr[i] == target:
return i
return -1