Linear Search

## How Linear Search Works

Linear Search is the simplest searching algorithm. It sequentially checks each element of the array until a match is found or the end is reached.

### Algorithm Steps:
1. Start from the first element
2. Compare current element with the target
3. If match found, return the index
4. If not, move to the next element
5. Repeat until found or end of array

### Key Characteristics:
- **Simple**: Easy to implement and understand
- **No prerequisites**: Works on unsorted arrays
- **Sequential**: Checks elements one by one