Linear Search
In plain terms
Finding an item by checking each element one by one.
Going deeper
Linear search scans a list sequentially until it finds the target or reaches the end. It's simple and works on unsorted data but is slow for large inputs.
Under the hood
O(n) time; the only option for unsorted data and fine for small lists, but binary search beats it on sorted data.
Examples
Small/unsorted lists, finding an item in an array, simple lookups.
Think of it like...
Like reading every name in a guest list top to bottom until you find the one you want.