What is the time complexity of the operation of searching for an element in a linked list?

In a linked list, the operation of searching for an element has a time complexity of O(n), where n is the number of elements in the list. This is because to find a specific element, it is necessary to sequentially traverse each node of the list, starting from the head, until the desired element is found or the end of the list is reached.