What algorithm or method is used when searching for an element in a linked list and what is its time complexity?

When searching for an element in a linked list, a simple linear search is usually used: elements are iterated starting from the head of the list until the desired element is found or the end is reached.

The time complexity of such a search is O(n), where n is the number of elements in the list, since in the worst case, the entire list must be traversed.