How is the time complexity of searching for an element in a list using the 'in' operator determined?

In Python, the in operator when checking for the presence of an element in a list performs a sequential search through the elements until it finds a match or reaches the end of the list. Therefore, the time complexity of such an operation is O(n), where n is the length of the list.

Example:

my_list = [1, 3, 5, 7, 9]
if 5 in my_list:
    print("Element found")

If the list is large, the search can be slow. For more efficient searching, it is better to use sets (set) or dictionaries (dict), where the in operation has an average complexity of O(1).