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

In a linked list, searching for an element by value requires sequential traversal of nodes, starting from the head of the list, until the desired element is found or the end of the list is reached. Therefore, the time complexity of the search is O(n), where n is the number of elements in the list.