How to evaluate the time complexity of the process of checking for an element's presence in a list?

The time complexity of checking for the presence of an element in a list depends on the data structure and the search method:

• For a regular list (e.g., Python list), searching for an element is a linear process, as you need to check each element in turn. The time complexity is O(n), where n is the number of elements.

• If using data structures with fast access, such as a set or a dictionary, the check for the presence of an element is O(1) on average, thanks to hashing.

Example:

my_list = [1, 2, 3, 4, 5]
print(3 in my_list)  # O(n)

my_set = {1, 2, 3, 4, 5}
print(3 in my_set)   # O(1)

Therefore, for frequent presence checks, it is better to use sets or dictionaries.