Concept: Linear Search is the simplest searching algorithm. It checks every element in the list sequentially until the desired element is found or the list ends.
Steps:
Start: Begin at the first element (index 0).
Compare: Compare the current element with the target value.
Match: If they match, return the index.
Next: If not, move to the next element.
End: Repeat until the target is found or the end of the list is reached.